Simultaneous Embedding of Planar Graphs with Few Bends

DOI10.7155/jgaa.00113zbMath1161.68664OpenAlexW2108115761MaRDI QIDQ5301376

Stephen G. Kobourov, Cesim Erten

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55411

zbMATH Keywords

evolutionary biologycontour tree simplification

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES ⋮ Untangling two systems of noncrossing curves ⋮ SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Shortest path embeddings of graphs on surfaces ⋮ Monotone Simultaneous Embeddings of Paths in d Dimensions ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree ⋮ Thickness and colorability of geometric graphs ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Relaxing the constraints of clustered planarity ⋮ Colored simultaneous geometric embeddings and universal pointsets ⋮ Matched drawability of graph pairs and of graph triples ⋮ Hierarchical partial planarity ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ Simultaneous embedding of colored graphs ⋮ Right Angle Crossing Drawings of Graphs ⋮ Beyond Clustered Planar Graphs ⋮ Advancements on SEFE and partitioned book embedding problems