Recommendations
Cited in
(25)- Disjoint paths in arborescences
- 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
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
- The \(b\)-branching problem in digraphs
- 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
- scientific article; zbMATH DE number 7144816 (Why is no real title available?)
- A note on disjoint arborescences
- Edmonds' branching theorem in digraphs without forward-infinite paths
- On reachability mixed arborescence packing
- On packing arborescences in temporal networks
- Covering directed graphs by in-trees
- Reachability in arborescence packings
- Packing of maximal independent mixed arborescences
- The root location problem for arc-disjoint arborescences
- Packing of spanning mixed arborescences
- Covering Directed Graphs by In-Trees
- On packing spanning arborescences with matroid constraint
- Independent arborescences in directed graphs
- Packing of arborescences with matroid constraints via matroid intersection
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- On maximal independent arborescence packing
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)
