Extended cuts
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1775387 (Why is no real title available?)
- Approximation Algorithms for Steiner and Directed Multicuts
- Extended cuts
- Finding good approximate vertex and edge partitions is NP-hard
- Minimal multicut and maximal integer multiflow: a survey
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- Multiway cuts in node weighted graphs
- On the minimum cut separator problem
- Optimal 3-terminal cuts and linear programming
- Recent directions in netlist partitioning: a survey
- The Complexity of Multiterminal Cuts
Cited in
(4)
This page was built for publication: Extended cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266025)