Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
From MaRDI portal
Recommendations
Cited in
(26)- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- An improved exact algorithm for TSP in graphs of maximum degree 4
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- scientific article; zbMATH DE number 7204413 (Why is no real title available?)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Counting problems in parameterized complexity
- A c^k n 5-approximation algorithm for treewidth
- Contraction-bidimensionality of geometric intersection graphs
- More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
- Cut and count and representative sets on branch decompositions
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem
- New analysis and computational study for the planar connected dominating set problem
- Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
- Degrees and gaps: tight complexity results of general factor problems parameterized by treewidth and cutwidth
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Linear kernels for outbranching problems in sparse digraphs
- Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- The P3 infection time is W[1]-hard parameterized by the treewidth
- Faster deterministic \textsc{Feedback Vertex Set}
- Solving SCS for bounded length strings in fewer than \(2^n\) steps
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
This page was built for publication: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326561)
