Distance and routing labeling schemes for non-positively curved plane graphs
From MaRDI portal
Publication:3414546
DOI10.1016/j.jalgor.2004.07.011zbMath1134.05331OpenAlexW2153353483MaRDI QIDQ3414546
Yann Vaxès, Feodor F. Dragan, Victor Chepoi
Publication date: 9 January 2007
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.07.011
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Convex excess in partial cubes ⋮ ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE ⋮ On finding convex cuts in general, bipartite and plane graphs ⋮ Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Implicit representation of relations ⋮ Shortest paths and convex hulls in 2D complexes with non-positive curvature ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Distributed Relationship Schemes for Trees ⋮ Isometric embedding of Busemann surfaces into \(L_1\) ⋮ Unnamed Item ⋮ Polyhexes that are \(\ell _1\) graphs ⋮ Localized and compact data-structure for comparability graphs ⋮ \(l_1\)-embeddability of generic quadrilateral Möbius maps ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs
This page was built for publication: Distance and routing labeling schemes for non-positively curved plane graphs
