Pages that link to "Item:Q3448810"
From MaRDI portal
The following pages link to Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810):
Displayed 6 items.
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
- (Q6089666) (← links)