The following pages link to (Q4875164):
Displaying 7 items.
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) (← links)
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- A subset spanner for Planar graphs, with application to subset TSP (Q2931435) (← links)
- A Better Approximation Algorithm for Finding Planar Subgraphs (Q4216139) (← links)
- Approximation algorithms for NP-complete problems on planar graphs (Q4299299) (← links)
- Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems (Q5301409) (← links)