The following pages link to (Q4373672):
Displaying 8 items.
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- Tree spanners in planar graphs (Q5928870) (← links)