Pages that link to "Item:Q3882476"
From MaRDI portal
The following pages link to Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory (Q3882476):
Displayed 4 items.
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
- Sensitivity analysis for symmetric 2-peripatetic salesman problems (Q2367396) (← links)
- Obtaining approximately optimal and diverse solutions via dispersion (Q6109008) (← links)