Pages that link to "Item:Q1014383"
From MaRDI portal
The following pages link to On the complexity of finding balanced oneway cuts (Q1014383):
Displaying 5 items.
- Most balanced minimum cuts (Q968139) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- (Q5092387) (← links)
- Bipartitioning of directed and mixed random graphs (Q5132545) (← links)
- Witnessing subsystems for probabilistic systems with low tree width (Q6649513) (← links)
