Pages that link to "Item:Q322301"
From MaRDI portal
The following pages link to On minimum bisection and related partition problems in graphs with bounded tree width (Q322301):
Displaying 14 items.
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Constrained domatic bipartition on trees (Q1751203) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- Approximating the minimum bisection size (extended abstract) (Q3192022) (← links)
- (Q3334089) (← links)
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (Q3339302) (← links)
- Problème de la bipartition minimale d'un graphe (Q3765553) (← links)
- On minimum bisection and related cut problems in trees and tree‐like graphs (Q4553736) (← links)
- (Q5414632) (← links)
- (Q5419980) (← links)
- (Q5443138) (← links)