Pages that link to "Item:Q1784745"
From MaRDI portal
The following pages link to NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745):
Displaying 13 items.
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- (Q2728855) (← links)
- (Q4373672) (← links)
- An FPT Algorithm for Minimum Additive Spanner Problem. (Q5874282) (← links)
- Parameterized Complexity of Directed Spanner Problems. (Q6089656) (← links)
- Complexity of the multiobjective minimum weight minimum stretch spanner problem (Q6616272) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)
