Graph Drawing
From MaRDI portal
Publication:5897628
DOI10.1007/11618058zbMath1171.68610OpenAlexW4251892597MaRDI QIDQ5897628
Jeremy Yu Meng, Michael T. Goodrich, David Eppstein
Publication date: 13 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11618058
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
On Strict (Outer-)Confluent Graphs ⋮ Planar and Poly-arc Lombardi Drawings ⋮ Approximating the Bundled Crossing Number ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ On strict (outer-)confluent graphs ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Dynamic Distance Hereditary Graphs Using Split Decomposition ⋮ Confluent Hasse Diagrams ⋮ Crossing Layout in Non-planar Graph Drawings
This page was built for publication: Graph Drawing
