Packing algorithms for arborescences (and spanning trees) in capacitated graphs

DOI10.1007/3-540-59408-6_67zbMath1500.90058OpenAlexW2171842972MaRDI QIDQ5101431

K. S. Manu, Harold N. Gabow

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_67

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forests, frames, and games: Algorithms for matroid sums and applications
• Geometric algorithms and combinatorial optimization
• A good algorithm for edge-disjoint branching
• On two minimax theorems in graph
• Edge-disjoint branching in directed multigraphs
• A faster algorithm for finding edge-disjoint branchings
• Strength of a graph and packing of trees and branchings
• NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
• On N–Edge–Connected Digraphs
• Fractional covers for forests and matchings
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Arc‐disjoint arborescences of digraphs
• Strength and reinforcement of a network and tree packing
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Minimum partition of a matroid into independent subsets

This page was built for publication: Packing algorithms for arborescences (and spanning trees) in capacitated graphs