Pages that link to "Item:Q4553736"
From MaRDI portal
The following pages link to On minimum bisection and related cut problems in trees and tree‐like graphs (Q4553736):
Displaying 9 items.
- On minimum bisection and related partition problems in graphs with bounded tree width (Q322301) (← links)
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- A parallel algorithm for bisection width in trees (Q1103410) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- (Q3725545) (← links)
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (Q3740255) (← links)
- (Q4260388) (← links)
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree (Q6076731) (← links)