Pages that link to "Item:Q3502671"
From MaRDI portal
The following pages link to A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671):
Displaying 5 items.
- On the directed full degree spanning tree problem (Q456701) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- On the Directed Degree-Preserving Spanning Tree Problem (Q3656869) (← links)
