Sciweavers

1664 search results - page 2 / 333
» Distance labeling in graphs
Sort
View
SODA
2001
ACM
77views Algorithms» more  SODA 2001»
13 years 6 months ago
Distance labeling in graphs
Cyril Gavoille, David Peleg, Stephane Perennes, Ra...
EJC
2007
13 years 5 months ago
Labeling planar graphs with a condition at distance two
Peter Bella, Daniel Král, Bojan Mohar, Kata...
STACS
2007
Springer
13 years 11 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
JCO
2006
128views more  JCO 2006»
13 years 5 months ago
A combinatorial theorem on labeling squares with points and its application
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
Binhai Zhu, Minghui Jiang
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 5 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...