On k-greedy routing algorithms

DOI10.1016/J.COMGEO.2015.10.008MaRDI QIDQ283869zbMATH OpenOpenAlexFDO

Authors Huaming Zhang, Xiangzhi Kong

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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• A generalized greedy routing algorithm for 2-connected graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• Greedy Routing via Embedding Graphs onto Semi-metric Spaces
• Succinct strictly convex greedy drawing of 3-connected plane graphs

Cites work

• scientific article; zbMATH DE number 2086693 (Why is no real title available?)
• scientific article; zbMATH DE number 786140 (Why is no real title available?)
• An Algorithm to Construct Greedy Drawings of Triangulations
• Compact floor-planning via orderly spanning trees
• Greedy drawings of triangulations
• Greedy routing via embedding graphs onto semi-metric spaces
• Improved floor-planning of graphs via adjacency-preserving transformations
• On Finding the Rectangular Duals of Planar Triangular Graphs
• On Floor-Plan of Plane Graphs
• On a conjecture related to geometric routing
• Some results on greedy embeddings in metric spaces
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct greedy geometric routing in the Euclidean plane
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs

Cited in

(4)

• Direct \(k\)-routing versus cross-docking: worst-case results
• Greedy Routing via Embedding Graphs onto Semi-metric Spaces
• A generalized greedy routing algorithm for 2-connected graphs
• Greedy Dynamic Routing on Arrays

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283869)