Pages that link to "Item:Q5248548"
From MaRDI portal
The following pages link to Finding minimum-quotient cuts in planar graphs (Q5248548):
Displaying 7 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation (Q1602943) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- (Q5743427) (← links)
