On k-greedy routing algorithms
From MaRDI portal
Publication:283869
DOI10.1016/J.COMGEO.2015.10.008zbMATH Open1335.05053OpenAlexW2202104035MaRDI QIDQ283869FDOQ283869
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
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
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)
Cites Work
- 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
- Greedy routing via embedding graphs onto semi-metric spaces
- Improved floor-planning of graphs via adjacency-preserving transformations
- On Floor-Plan of Plane Graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Compact floor-planning via orderly spanning trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm to Construct Greedy Drawings of Triangulations
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
Cited In (4)
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)
