Succinct Greedy Drawings Do Not Always Exist
From MaRDI portal
Publication:3557876
DOI10.1007/978-3-642-11805-0_17zbMath1284.68440OpenAlexW1549186549MaRDI QIDQ3557876
Giuseppe Di Battista, Patrizio Angelini, Fabrizio Frati
Publication date: 27 April 2010
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11805-0_17
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
A generalized greedy routing algorithm for 2-connected graphs ⋮ Greedy routing via embedding graphs onto semi-metric spaces ⋮ A simple routing algorithm based on Schnyder coordinates ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces