A Note on the Practicality of Maximal Planar Subgraph Algorithms
From MaRDI portal
Publication:2961528
DOI10.1007/978-3-319-50106-2_28zbMath1478.68225arXiv1608.07505OpenAlexW2507175560MaRDI QIDQ2961528
Karsten Klein, Markus Chimani, Tilo Wiedera
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07505
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Non-planar core reduction of graphs
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- A new planarity test
- An experimental comparison of four graph drawing algorithms.
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY
- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- A Better Approximation Algorithm for Finding Planar Subgraphs
- Generating Random Regular Graphs Quickly
- Efficient Extraction of Multiple Kuratowski Subdivisions
- Computing and Combinatorics
- Advances in the Planarization Method: Effective Multiple Edge Insertions
