Computing Maximum C-Planar Subgraphs

DOI10.1007/978-3-642-00219-9_12MaRDI QIDQ3611845zbMATH OpenOpenAlexWikidataFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 1974122
• Graph Drawing
• Planarity for clustered graphs
• A new perspective on clustered planarity as a combinatorial embedding problem
• A new perspective on clustered planarity as a combinatorial embedding problem

Cites work

• scientific article; zbMATH DE number 2084266 (Why is no real title available?)
• scientific article; zbMATH DE number 1189242 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• An experimental comparison of four graph drawing algorithms.
• Clustered Planarity: Small Clusters in Eulerian Graphs
• Completely connected clustered graphs
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Efficient Extraction of Multiple Kuratowski Subdivisions
• Graph Drawing
• Graph Drawing
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• Planarity for clustered graphs
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Cited in

(3)

• Beyond Clustered Planar Graphs
• Constrained planarity in practice -- engineering the synchronized planarity algorithm
• Advances on testing C-planarity of embedded flat clustered graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611845)