Pages that link to "Item:Q5301409"
From MaRDI portal
The following pages link to Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems (Q5301409):
Displaying 9 items.
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- Exact Algorithm for the Maximum Induced Planar Subgraph Problem (Q3092237) (← links)
- A Better Approximation Algorithm for Finding Planar Subgraphs (Q4216139) (← links)
- A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)