The following pages link to (Q4744300):
Displaying 20 items.
- Submodular functions in graph theory (Q686469) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- Structures of subpartitions related to a submodular function minimization (Q1365312) (← links)
- On the orientation of graphs and hypergraphs (Q1410690) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Packing of mixed hyperarborescences with flexible roots via matroid intersection (Q2048562) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Packing of spanning mixed arborescences (Q6056788) (← links)
- Matroid-rooted packing of arborescences (Q6646737) (← links)
