scientific article; zbMATH DE number 3799695
From MaRDI portal
Publication:4744300
zbMath0507.05054MaRDI QIDQ4744300
No author found.
Publication date: 1981
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) Graph theory (05C99)
Related Items (19)
Algorithms for finding a rooted \((k,1)\)-edge-connected orientation ⋮ Structures of subpartitions related to a submodular function minimization ⋮ Reachability in arborescence packings ⋮ Generalized polymatroids and submodular flows ⋮ An application of submodular flows ⋮ Packing of spanning mixed arborescences ⋮ On reachability mixed arborescence packing ⋮ On the orientation of graphs and hypergraphs ⋮ Restricted covering of digraphs with arborescences ⋮ Arc-disjoint paths and trees in 2-regular digraphs ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ Blocking unions of arborescences ⋮ Blocking optimal structures ⋮ Submodular functions in graph theory ⋮ Packing of mixed hyperarborescences with flexible roots via matroid intersection ⋮ Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings ⋮ Packing algorithms for arborescences (and spanning trees) in capacitated graphs
This page was built for publication:
