Computing Maximum C-Planar Subgraphs

DOI10.1007/978-3-642-00219-9_12zbMath1213.68434OpenAlexW1527531972WikidataQ56977177 ScholiaQ56977177MaRDI QIDQ3611845

Markus Chimani, Mathias Jansen, Carsten Gutwenger, Petra Mutzel, Karsten Klein

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

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Beyond Clustered Planar Graphs

Cites Work

• 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.
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• 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

This page was built for publication: Computing Maximum C-Planar Subgraphs