Pages that link to "Item:Q2166224"
From MaRDI portal
The following pages link to Reachability in arborescence packings (Q2166224):
Displaying 8 items.
- A note on disjoint arborescences (Q532132) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q1290635) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- On packing time-respecting arborescences (Q2172082) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- On maximal independent arborescence packing (Q2832576) (← links)
- Packing of spanning mixed arborescences (Q6056788) (← links)