Pages that link to "Edmonds' disjoint arborescences theorem"
The following pages link to Edmonds' disjoint arborescences theorem:
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Packing common bases (← links)
- Trees and branchings (transclusion) (← links)
- Making the union of two directed spanning trees strongly connected (← links)
- Union of a spanning arborescence and a directed spanning tree (← links)
- Integer decomposition property (← links)
- Capacitated packing of k-arborescences (← links)
- Strongly edge-disjoint arborescences (← links)
- Independent arborescences in acyclic digraphs (← links)