Pages that link to "Item:Q4216139"
From MaRDI portal
The following pages link to A Better Approximation Algorithm for Finding Planar Subgraphs (Q4216139):
Displaying 32 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) (← links)
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276) (← links)
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) (← links)
- Maximum series-parallel subgraph (Q2429333) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Large planar subgraphs in dense graphs (Q2573646) (← links)
- Algebraic algorithms for linear matroid parity problems (Q2799476) (← links)
- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (Q2819516) (← links)
- A subset spanner for Planar graphs, with application to subset TSP (Q2931435) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- Finding Triangles for Maximum Planar Subgraphs (Q2980925) (← links)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- An efficient graph planarization two‐phase heuristic (Q4285458) (← links)
- Approximation algorithms for NP-complete problems on planar graphs (Q4299299) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- (Q4875164) (← links)
- (Q5009576) (← links)
- (Q5090466) (← links)
- (Q5140734) (← links)
- Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems (Q5301409) (← links)
- (Q5708499) (← links)
- Angles of arc-polygons and lombardi drawings of cacti (Q6103170) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
