Min-cut partitioning on underlying tree and graph structures
From MaRDI portal
Publication:4420947
Recommendations
Cited in
(15)- Improving graph partitions using submodular functions.
- Partitioning graphs on message-passing machines by pairwise mincut
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
- A fast hypergraph min-cut algorithm for circuit partitioning
- Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
- scientific article; zbMATH DE number 5904848 (Why is no real title available?)
- Recent directions in netlist partitioning: a survey
- scientific article; zbMATH DE number 3866593 (Why is no real title available?)
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- scientific article; zbMATH DE number 3876616 (Why is no real title available?)
- A Gomory-Hu cut tree representation of a netlist partitioning problem
- Optimal cuts and partitions in tree metrics in polynomial time
- scientific article; zbMATH DE number 139787 (Why is no real title available?)
- scientific article; zbMATH DE number 1982182 (Why is no real title available?)
- Vertex splitting in dags and applications to partial scan designs and lossy circuits
This page was built for publication: Min-cut partitioning on underlying tree and graph structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420947)