ESPY
发表于 2025-3-25 04:00:56
http://reply.papertrans.cn/16/1532/153166/153166_21.png
大看台
发表于 2025-3-25 10:43:51
Maintaining the Visibility Graph of a Dynamic Simple Polygon,visibility graph of .. Further, as part of efficiently updating the visibility graph, a fully-dynamic algorithm is designed to compute the vertices of the current simple polygon that are visible from a query point.
contradict
发表于 2025-3-25 13:54:19
http://reply.papertrans.cn/16/1532/153166/153166_23.png
GET
发表于 2025-3-25 17:47:37
http://reply.papertrans.cn/16/1532/153166/153166_24.png
鸟笼
发表于 2025-3-26 00:01:27
http://reply.papertrans.cn/16/1532/153166/153166_25.png
过份艳丽
发表于 2025-3-26 01:50:45
A Lower Bound for the Radio Number of Graphs,er bound. Using this result, we determine the radio number for cartesian product of paths . and the Peterson graph .. We give a short proof for the radio number of cartesian product of paths . and complete graphs . given by Kim . in [.].
险代理人
发表于 2025-3-26 06:08:48
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees,plane tree . of . leaves, . of which have been .. Each marked leaf is associated with a . (a subtree of .) and any topologically consecutive marked leaves have disjoint neighborhoods. We show how to select in linear time a constant fraction of the marked leaves that have pairwise disjoint neighborhoods.
马笼头
发表于 2025-3-26 11:55:53
http://reply.papertrans.cn/16/1532/153166/153166_28.png
Angiogenesis
发表于 2025-3-26 13:44:33
Mathematisch-physikalische Bibliothekper, we consider the problem of partitioning a graph into a minimum number of induced stars and its decision versions. This problem may be viewed as an amalgamation of the well-known dominating set problem and coloring problem. Although this problem coincides with the dominating set problem on .-fre
cacophony
发表于 2025-3-26 19:39:30
Mathematisch-physikalische Bibliothekts . is defined as . if . and it is zero if .. Here, .(., .) is the (geodesic) Euclidean distance between . and .. For a real number ., a graph .(., .) is called a . for the weighted set . of points if for any two points . and . in . the distance between . and . in graph . is at most ... for a real