scientific article; zbMATH DE number 871895
From MaRDI portal
Publication:4875164
Recommendations
- A Better Approximation Algorithm for Finding Planar Subgraphs
- A new approximation algorithm for finding heavy planar subgraphs
- A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
- A linear time algorithm for finding maximal planar subgraphs
- Two new approximation algorithms for the maximum planar subgraph problem
- A linear-time algorithm for finding induced planar subgraphs
- scientific article; zbMATH DE number 2084267
- A note on the practicality of maximal planar subgraph algorithms
- Fast sub-exponential algorithms and compactness in planar graphs
- A linear algorithm for the maximal planar subgraph problem
Cited in
(13)- On the \(k\)-restricted structure ratio in planar and outerplanar graphs
- A subset spanner for Planar graphs, with application to subset TSP
- A new approximation algorithm for finding heavy planar subgraphs
- scientific article; zbMATH DE number 910888 (Why is no real title available?)
- Finding large planar subgraphs and large subgraphs of a given genus
- Finding triangles for maximum planar subgraphs
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
- A note on the maximum weight planar subgraph problem
- Approximation algorithms for NP-complete problems on planar graphs
- A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
- Two new approximation algorithms for the maximum planar subgraph problem
- Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
- On maximum planar induced subgraphs
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 Q4875164)
