Pages that link to "Item:Q3954831"
From MaRDI portal
The following pages link to An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (Q3954831):
Displaying 8 items.
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- The maximum clique problem (Q1318271) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Optimization and operations research in mitigation of a pandemic (Q2158111) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)