Pages that link to "Item:Q1932355"
From MaRDI portal
The following pages link to Improved Steiner tree algorithms for bounded treewidth (Q1932355):
Displaying 4 items.
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
