Pages that link to "Item:Q2034399"
From MaRDI portal
The following pages link to A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399):
Displaying 5 items.
- On minimum bisection and related partition problems in graphs with bounded tree width (Q322301) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- On minimum bisection and related cut problems in trees and tree‐like graphs (Q4553736) (← links)
- (Q5365080) (← links)