Pages that link to "Item:Q1924999"
From MaRDI portal
The following pages link to Parallel approximation schemes for problems on planar graphs (Q1924999):
Displaying 8 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (Q3104772) (← links)
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
