A greedy algorithm for multicut and integral multiflow in rooted trees
From MaRDI portal
Recommendations
Cites work
Cited in
(9)- Improved algorithms for the multicut and multiflow problems in rooted trees
- Multicuts and integral multiflows in rings
- Models and methods for solving the problem of network vulnerability
- Multiway cut and integer flow problems in trees
- scientific article; zbMATH DE number 6861995 (Why is no real title available?)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Minimal multicut and maximal integer multiflow: a survey
This page was built for publication: A greedy algorithm for multicut and integral multiflow in rooted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869999)