Computing Maximum C-Planar Subgraphs
From MaRDI portal
Publication:3611845
DOI10.1007/978-3-642-00219-9_12zbMath1213.68434WikidataQ56977177 ScholiaQ56977177MaRDI QIDQ3611845
Carsten Gutwenger, Petra Mutzel, Markus Chimani, Karsten Klein, Mathias Jansen
Publication date: 3 March 2009
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_12
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- Completely connected clustered graphs
- An experimental comparison of four graph drawing algorithms.
- Efficient Extraction of Multiple Kuratowski Subdivisions
- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
- Clustered Planarity: Small Clusters in Eulerian Graphs
- Graph Drawing
- Graph Drawing
- Planarity for clustered graphs