Pages that link to "Item:Q3186835"
From MaRDI portal
The following pages link to Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below (Q3186835):
Displaying 2 items.
- On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights (Q2117617) (← links)
- On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter (Q6082044) (← links)
