scientific article
From MaRDI portal
Publication:2999648
zbMath1217.05057MaRDI QIDQ2999648
Publication date: 16 May 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (11)
Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ On reachability mixed arborescence packing ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ A faster algorithm for packing branchings in digraphs ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ A rooted-forest partition with uniform vertex demand ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings ⋮ On Maximal Independent Arborescence Packing
This page was built for publication:
