Sciweavers

1664 search results - page 65 / 333
» Distance labeling in graphs
Sort
View
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
14 years 10 months ago
Multi-agent path planning with multiple tasks and distance constraints
— 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...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
WG
2004
Springer
15 years 5 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
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...
Sabine Cornelsen, Gabriele Di Stefano
CVGIP
2004
121views more  CVGIP 2004»
14 years 11 months ago
Skeleton-driven 2D distance field metamorphosis using intrinsic shape parameters
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...
WuJun Che, XunNian Yang, GuoZhao Wang
BMCBI
2006
127views more  BMCBI 2006»
14 years 12 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
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...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
STOC
2001
ACM
139views Algorithms» more  STOC 2001»
16 years 5 days ago
Approximate distance oracles
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...
Mikkel Thorup, Uri Zwick