Graph Drawing
From MaRDI portal
Publication:5897631
DOI10.1007/11618058zbMath1171.68615OpenAlexW4251892597MaRDI QIDQ5897631
Markus Geyer, Imrich Vrt'o, Michael Kaufmann
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) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ Characterization of unlabeled level planar trees ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Colored simultaneous geometric embeddings and universal pointsets ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ Graph Simultaneous Embedding Tool, GraphSET
This page was built for publication: Graph Drawing
