Some results on greedy embeddings in metric spaces
From MaRDI portal
Publication:603850
DOI10.1007/s00454-009-9227-6zbMath1230.05269OpenAlexW2168630584WikidataQ57074825 ScholiaQ57074825MaRDI QIDQ603850
Publication date: 8 November 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9227-6
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (37)
On the plane angle-monotone graphs ⋮ Angle-monotonicity of Delaunay triangulation ⋮ On \(k\)-greedy routing algorithms ⋮ Succinct greedy drawings do not always exist ⋮ (Weakly) self-approaching geometric graphs and spanners ⋮ Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles ⋮ Monotone Drawings of 3-Connected Plane Graphs ⋮ Compact Monotone Drawing of Trees ⋮ Computing Tutte Paths ⋮ A generalized greedy routing algorithm for 2-connected graphs ⋮ Euclidean greedy drawings of trees ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ Greedy routing via embedding graphs onto semi-metric spaces ⋮ A simple routing algorithm based on Schnyder coordinates ⋮ Monotone Drawings of Graphs with Fixed Embedding ⋮ Optimal Monotone Drawings of Trees ⋮ Angles of arc-polygons and lombardi drawings of cacti ⋮ Space lower bounds for low-stretch greedy embeddings ⋮ Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition ⋮ An optimal greedy routing algorithm for triangulated polygons ⋮ Shifting strategy for geometric graphs without geometry ⋮ Succinct strictly convex greedy drawing of 3-connected plane graphs ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ Monotone drawings of graphs with few directions ⋮ Distributed computation of virtual coordinates for greedy routing in sensor networks ⋮ Minimum weight convex Steiner partitions ⋮ On the area requirements of planar greedy drawings of triconnected planar graphs ⋮ Greedy rectilinear drawings ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Greedy rectilinear drawings ⋮ Succinct Greedy Graph Drawing in the Hyperbolic Plane ⋮ Every Schnyder drawing is a greedy embedding ⋮ Drawing graphs as spanners ⋮ An Algorithm to Construct Greedy Drawings of Triangulations ⋮ Unnamed Item ⋮ Monotone drawings of graphs with fixed embedding
Cites Work
This page was built for publication: Some results on greedy embeddings in metric spaces
