On reachability mixed arborescence packing

DOI10.1016/j.disopt.2018.10.002zbMath1506.05176arXiv1808.07332OpenAlexW2888223998WikidataQ129035242 ScholiaQ129035242MaRDI QIDQ2419578

Tatsuya Matsuoka, Shin-ichi Tanigawa

Publication date: 14 June 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.07332

zbMATH Keywords

reachabilitymixed graphsupermodular functionarborescence packing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Reachability in arborescence packings ⋮ Packing of spanning mixed arborescences ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Complexity of packing common bases in matroids

Cites Work

• Arc-disjoint in-trees in directed graphs
• Old and new results on packing arborescences in directed hypergraphs
• Packing of arborescences with matroid constraints via matroid intersection
• Covering Intersecting Bi-set Families under Matroid Constraints
• A Survey on Covering Supermodular Functions
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Variations for Lovász’ Submodular Ideas
• Directed Network Design with Orientation Constraints
• Unnamed Item
• Unnamed Item

This page was built for publication: On reachability mixed arborescence packing