Pages that link to "Item:Q2392926"
From MaRDI portal
The following pages link to Computing optimal Steiner trees in polynomial space (Q2392926):
Displaying 11 items.
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← 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)
- Dynamic programming for minimum Steiner trees (Q2464320) (← links)
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (Q2840557) (← links)
- Improved Steiner Tree Algorithms for Bounded Treewidth (Q3111665) (← 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)
- Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (Q4686678) (← links)
