1664 search results - page 65 / 333 » Distance labeling in graphs |
121
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
135
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
129
click to vote
CVGIP
2004
15 years 3 months ago
2004
In this article a novel algorithm is presented for 2D shape interpolation using the intrinsic shape parameters of a piecewise linear curve. The skeletons of two given shapes are c...
145
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
121
Voted
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...