Pages that link to "Item:Q845968"
From MaRDI portal
The following pages link to Minimum cost subpartitions in graphs (Q845968):
Displaying 11 items.
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- Minimum degree orderings (Q848936) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- Minimizing branching vertices in distance-preserving subgraphs (Q2330556) (← links)
- Minimum Cost Partitions of Trees with Supply and Demand (Q3060787) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- (Q5077149) (← links)
- (Q5091155) (← links)
- Min-Max Graph Partitioning and Small Set Expansion (Q5494941) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)