Pages that link to "Item:Q2682929"
From MaRDI portal
The following pages link to Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929):
Displaying 5 items.
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- Spanners in graphs of bounded degree (Q4303628) (← links)
- (Q4373672) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)