Pages that link to "Item:Q2197544"
From MaRDI portal
The following pages link to Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544):
Displaying 5 items.
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
- Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes (Q2671810) (← links)
- Optimality characterization of the minimum stretch spanning tree problem for interval graphs (Q4986072) (← links)
- New results on edge-coloring and total-coloring of split graphs (Q6648272) (← links)