Pages that link to "Item:Q2656713"
From MaRDI portal
The following pages link to Optimality computation of the minimum stretch spanning tree problem (Q2656713):
Displaying 10 items.
- Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- Minimum spanning table and optimal expansion of competence set (Q1969528) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- Optimality characterization of the minimum stretch spanning tree problem for interval graphs (Q4986072) (← links)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)