On \(k\)-greedy routing algorithms

DOI10.1016/j.comgeo.2015.10.008zbMath1335.05053OpenAlexW2202104035MaRDI QIDQ283869

Xiang-Zhi Kong, Huaming Zhang

Publication date: 17 May 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.10.008

zbMATH Keywords

\(k\)-greedy drawing\(k\)-greedy routinggreedy routingplane graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Greedy routing via embedding graphs onto semi-metric spaces
• Improved floor-planning of graphs via adjacency-preserving transformations
• Some results on greedy embeddings in metric spaces
• Greedy drawings of triangulations
• On a conjecture related to geometric routing
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct Greedy Geometric Routing in the Euclidean Plane
• On Floor-Plan of Plane Graphs
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Compact floor-planning via orderly spanning trees
• An Algorithm to Construct Greedy Drawings of Triangulations

This page was built for publication: On \(k\)-greedy routing algorithms