Arc-disjoint in-trees in directed graphs

DOI10.1007/s00493-009-2428-zzbMath1212.05209WikidataQ126592761 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

zbMATH Keywords

packing; arc-connectivity; directed trees

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C40: Connectivity

Related Items

Unnamed Item, The root location problem for arc-disjoint arborescences, On packing arborescences in temporal networks, A note on disjoint arborescences, 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, On packing spanning arborescences with matroid constraint, Old and new results on packing arborescences in directed hypergraphs, An LP-based heuristic algorithm for the node capacitated in-tree packing problem, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Reachability in arborescence packings, Packing of arborescences with matroid constraints via matroid intersection, The \(b\)-branching problem in digraphs, Packing of maximal independent mixed arborescences, Packing branchings under cardinality constraints on their root sets, On reachability mixed arborescence packing, Covering Intersecting Bi-set Families under Matroid Constraints, On Maximal Independent Arborescence Packing, Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths