optic-nerve
发表于 2025-3-27 00:10:00
http://reply.papertrans.cn/103/10201/1020037/1020037_31.png
冲击力
发表于 2025-3-27 05:04:28
Computation of Non-dominated Points Using Compact Voronoi Diagrams is non-dominated if and only if for each .. ∈ ., ., there exists at least one point . ∈ . that is closer to .. than ... We reduce this problem of determining non-dominated points to the problem of finding sites that have non-empty cells in an additively weighted Voronoi diagram under convex distanc
Acetaldehyde
发表于 2025-3-27 08:10:17
http://reply.papertrans.cn/103/10201/1020037/1020037_33.png
安慰
发表于 2025-3-27 11:34:18
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motionith a subset of . under rigid motion (rotation and/or translation) transformation such that each point in . lies in the .-neighborhood of a point in .. The .-neighborhood region of a point .. ∈ . is an axis-parallel square having each side of length . and .. at its centroid. We assume that the point
fastness
发表于 2025-3-27 16:41:22
http://reply.papertrans.cn/103/10201/1020037/1020037_35.png
Factorable
发表于 2025-3-27 19:17:22
Acyclically 3-Colorable Planar Graphsmaximum degree 4 and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such th
Engaged
发表于 2025-3-28 01:23:48
Reconstruction Algorithm for Permutation Graphsic aspects of the conjecture. We present an . time algorithm for PREIMAGE CONSTRUCTION on permutation graphs, where . is the number of graphs in the input. Since each graph of the input has . − 1 vertices and . edges, the input size is .. There are polynomial time isomorphism algorithms for permutat
PARA
发表于 2025-3-28 03:37:16
A Rooted-Forest Partition with Uniform Vertex Demandts no cycle consisting of non-loop edges. In this paper, we shall study on a partition of a graph into edge-disjoint rooted-forests such that each vertex is spanned by exactly . components of the partition, where . is a positive integer.
Calculus
发表于 2025-3-28 10:14:50
Harmonious Coloring on Subclasses of Colinear Graphs harmonious chromatic number is the least integer . for which . admits a harmonious coloring with . colors. Extending previous NP-completeness results of the harmonious coloring problem on subclasses of chordal and co-chordal graphs, we prove that the problem remains NP-complete for split undirected
荣幸
发表于 2025-3-28 11:13:32
http://reply.papertrans.cn/103/10201/1020037/1020037_40.png