A note on disjoint arborescences

DOI10.1007/s00493-010-2518-yzbMath1224.05406OpenAlexW1974428378MaRDI QIDQ532132

Satoru Fujishige

Publication date: 26 April 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/130690

zbMATH Keywords

reachabilitybranchingarborescencesspanning trees

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (14)

Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ The root location problem for arc-disjoint arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ On packing arborescences in temporal networks ⋮ A faster algorithm for packing branchings in digraphs ⋮ A rooted-forest partition with uniform vertex demand ⋮ A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings ⋮ Covering Intersecting Bi-set Families under Matroid Constraints ⋮ On Maximal Independent Arborescence Packing ⋮ Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths

Cites Work

• Arc-disjoint in-trees in directed graphs

This page was built for publication: A note on disjoint arborescences