Finding triangles for maximum planar subgraphs
DOI10.1007/978-3-319-53925-6_29zbMATH Open1485.68310OpenAlexW2625058834MaRDI QIDQ2980925FDOQ2980925
Authors: Parinya Chalermsook, Andreas Schmid 
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_29
Recommendations
- Limits of greedy approximation algorithms for the maximum planar subgraph problem
- Two new approximation algorithms for the maximum planar subgraph problem
- A note on the practicality of maximal planar subgraph algorithms
- A Better Approximation Algorithm for Finding Planar Subgraphs
- scientific article; zbMATH DE number 871895
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
- A Better Approximation Algorithm for Finding Planar Subgraphs
- Handbook of graph drawing and visualization
- Handbook of Approximation Algorithms and Metaheuristics
- Maximum series-parallel subgraph
- Large planar subgraphs in dense graphs
- On the complexity of the approximation of nonplanarity parameters for cubic graphs
- Title not available (Why is that?)
- An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
- A new approximation algorithm for finding heavy planar subgraphs
- Two new approximation algorithms for the maximum planar subgraph problem
Cited In (12)
- Use of MAX-CUT for Ramsey Arrowing of Triangles
- A note on the practicality of maximal planar subgraph algorithms
- Triangulating planar graphs while minimizing the maximum degree
- Exact algorithms for the maximum planar subgraph problem: new models and experiments
- Limits of greedy approximation algorithms for the maximum planar subgraph problem
- Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
- An improved algorithm for finding maximum outerplanar subgraphs
- Star-struck by fixed embeddings: modern crossing number heuristics
- Title not available (Why is that?)
- Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
- Title not available (Why is that?)
This page was built for publication: Finding triangles for maximum planar subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980925)
