Arc-disjoint in-trees in directed graphs
From MaRDI portal
Publication:987553
DOI10.1007/s00493-009-2428-zzbMath1212.05209OpenAlexW1987229183WikidataQ126592761 ScholiaQ126592761MaRDI QIDQ987553
Naoki Katoh, Atsushi Takizawa, Naoyuki Kamiyama
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/123379
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (20)
Reachability in arborescence packings ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ Packing of spanning mixed arborescences ⋮ On reachability mixed arborescence packing ⋮ On packing spanning arborescences with matroid constraint ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ The root location problem for arc-disjoint arborescences ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ On packing arborescences in temporal networks ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ A note on disjoint arborescences ⋮ A rooted-forest partition with uniform vertex demand ⋮ An LP-based heuristic algorithm for the node capacitated in-tree packing problem ⋮ A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph ⋮ Covering Intersecting Bi-set Families under Matroid Constraints ⋮ On Maximal Independent Arborescence Packing ⋮ Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths
This page was built for publication: Arc-disjoint in-trees in directed graphs
