scientific article; zbMATH DE number 2084267

MaRDI QIDQ3043706zbMATH OpenFDO

Authors Keith Edwards, Graham Farr

Publication date 6 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650075.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Exact algorithm for the maximum induced planar subgraph problem
• Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
• Planar induced subgraphs of sparse graphs
• Planar induced subgraphs of sparse graphs
• Planarization and fragmentability of some classes of graphs

Cited in

(9)

• A new approximation algorithm for finding heavy planar subgraphs
• Planarization and fragmentability of some classes of graphs
• Planar induced subgraphs of sparse graphs
• Large Induced Subgraphs via Triangulations and CMSO
• Exact algorithm for the maximum induced planar subgraph problem
• Planarization and acyclic colorings of subcubic claw-free graphs
• scientific article; zbMATH DE number 871895 (Why is no real title available?)
• A linear-time algorithm for finding induced planar subgraphs
• Planar induced subgraphs of sparse graphs

This page was built for publication:

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