Arborescence Problems in Directed Graphs: Theorems and Algorithms

DOI10.4036/iis.2014.51zbMath1288.05116OpenAlexW2315096310MaRDI QIDQ5417532

Naoyuki Kamiyama

Publication date: 21 May 2014

Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.2014.51

zbMATH Keywords

matroidpacking problemarborescence

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Epicenter of random epidemic spanning trees on finite graphs ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings

This page was built for publication: Arborescence Problems in Directed Graphs: Theorems and Algorithms