The following pages link to (Q3933762):
Displaying 8 items.
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- \(N\)-separators in planar graphs (Q661948) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)