Arc-disjoint in-trees in directed graphs
From MaRDI portal
Publication:987553
DOI10.1007/S00493-009-2428-ZzbMATH Open1212.05209OpenAlexW1987229183WikidataQ126592761 ScholiaQ126592761MaRDI QIDQ987553FDOQ987553
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
Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (21)
- Covering intersecting bi-set families under matroid constraints
- Packing branchings under cardinality constraints on their root sets
- Old and new results on packing arborescences in directed hypergraphs
- A rooted-forest partition with uniform vertex demand
- The \(b\)-branching problem in digraphs
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem
- Title not available (Why is that?)
- Edmonds' branching theorem in digraphs without forward-infinite paths
- A note on disjoint arborescences
- On reachability mixed arborescence packing
- On packing arborescences in temporal networks
- Reachability in arborescence packings
- Packing of maximal independent mixed arborescences
- Packing of spanning mixed arborescences
- The root location problem for arc-disjoint arborescences
- On packing spanning arborescences with matroid constraint
- Title not available (Why is that?)
- On maximal independent arborescence packing
- Packing of arborescences with matroid constraints via matroid intersection
This page was built for publication: Arc-disjoint in-trees in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987553)
