The following pages link to (Q4737194):
Displayed 4 items.
- On minimum bisection and related partition problems in graphs with bounded tree width (Q322301) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)