Packing arborescences

MaRDI QIDQ2999648zbMATH OpenFDO

Authors Kristóf Bérczi, András Frank

Publication date 16 May 2011

zbMATH Keywords

arborescencebranchingcoveringpackingspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Covering intersecting bi-set families under matroid constraints
• Packing of maximal independent mixed arborescences
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Reachability in arborescence packings

Cited in

(16)

• Packing in trees
• Old and new results on packing arborescences in directed hypergraphs
• Packing of arborescences with matroid constraints via matroid intersection
• Packing of maximal independent mixed arborescences
• Packing branchings under cardinality constraints on their root sets
• On reachability mixed arborescence packing
• Packing in generalized kernel systems: a framework that generalizes packing of branchings
• On maximal independent arborescence packing
• Stronger bounds and faster algorithms for packing in generalized kernel systems
• Computing pure Nash and strong equilibria in bottleneck congestion games
• A faster algorithm for packing branchings in digraphs
• Matroid-Based Packing of Arborescences
• Packing trees
• Matroid-reachability-based decomposition into arborescences
• Regular packing of rooted hyperforests with root constraints in hypergraphs
• A rooted-forest partition with uniform vertex demand

This page was built for publication: Packing arborescences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999648)