scientific article
From MaRDI portal
zbMath0312.90037MaRDI QIDQ4070624
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Reachability in arborescence packings, Packing of arborescences with matroid constraints via matroid intersection, FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs, Immersing complete digraphs, Discrete extremal problems, Edge-disjoint branchings in temporal digraphs, Packing of mixed hyperarborescences with flexible roots via matroid intersection, Integer programming duality: Price functions and sensitivity analysis, Equivalence between the minimum covering problem and the maximum matching problem
