An efficient scaling algorithm for the minimum weight bibranching problem
From MaRDI portal
Recommendations
Cites work
- A data structure for dynamic trees
- An efficient algorithm for minimum-weight bibranching
- An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Faster scaling algorithms for general graph matching problems
- Faster Scaling Algorithms for Network Problems
- How to make a digraph strongly connected
- scientific article; zbMATH DE number 437545 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- Introduction to algorithms
- Min-max Relations for Directed Graphs
- Optimum branchings
Cited in
(5)- An efficient algorithm for minimum-weight bibranching
- Relationship of two formulations for shortest bibranchings
- Equitable partitions into matchings and coverings in mixed graphs
- An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
- The b‐bibranching problem: TDI system, packing, and discrete convexity
This page was built for publication: An efficient scaling algorithm for the minimum weight bibranching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652532)