Pages that link to "Item:Q1949736"
From MaRDI portal
The following pages link to Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736):
Displaying 31 items.
- On finding rainbow and colorful paths (Q266284) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- On the terminal connection problem (Q831820) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
- Exact Algorithms for the Minimum Load Spanning Tree Problem (Q5084607) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- (Q5140739) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Parameterized algorithms for the Steiner arborescence problem on a hypercube (Q6659999) (← links)
