Pages that link to "Item:Q2392926"
From MaRDI portal
The following pages link to Computing optimal Steiner trees in polynomial space (Q2392926):
Displayed 6 items.
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- Inexact graph matching using a hierarchy of matching processes (Q2288126) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)