Finding paths of length k in O^*(2ᵏ) time
From MaRDI portal
Publication:976105
DOI10.1016/J.IPL.2008.11.004zbMATH Open1191.68857OpenAlexW1852383912WikidataQ56639269 ScholiaQ56639269MaRDI QIDQ976105FDOQ976105
Authors: Ryan Williams 
Publication date: 16 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.11.004
Recommendations
Cites Work
- A Dynamic Programming Approach to Sequencing Problems
- Improved algorithms for path, matching, and packing problems
- Faster Algebraic Algorithms for Path and Packing Problems
- Title not available (Why is that?)
- Color-coding
- Title not available (Why is that?)
- Designing programs that check their work
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Fast construction of irreducible polynomials over finite fields
- Divide-and-Color
- Dynamic programming meets the principle of inclusion and exclusion
- Title not available (Why is that?)
Cited In (74)
- Long directed detours: reduction to 2-disjoint paths
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- Approximating long cycle above Dirac's guarantee
- Spotting trees with few leaves
- Title not available (Why is that?)
- Balanced substructures in bicolored graphs
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms
- Going far from degeneracy
- Finding detours is fixed-parameter tractable
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs
- Engineering motif search for large motifs
- Title not available (Why is that?)
- Decomposition of Map Graphs with Applications.
- Algebraic data retrieval algorithms for multi-channel wireless data broadcast
- On testing monomials in multivariate polynomials
- The \(k\)-distinct language: parameterized automata constructions
- Computing Pathwidth Faster Than 2 n
- Title not available (Why is that?)
- Sharp separation and applications to exact and parameterized algorithms
- Constrained multilinear detection and generalized graph motifs
- A randomized algorithm for long directed cycle
- Fast exact algorithms using Hadamard product of polynomials
- The maximum binary tree problem
- Constrained multilinear detection for faster functional motif discovery
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- What's next? Future directions in parameterized complexity
- A fast parallel algorithm for minimum-cost small integral flows
- Patching colors with tensors
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- A note on algebraic techniques for subgraph detection
- Fast algorithms for parameterized problems with relaxed disjointness constraints
- Faster deterministic parameterized algorithm for \(k\)-path
- Spotting trees with few leaves
- Extensor-coding
- Randomized parameterized algorithms for the kidney exchange problem
- On the parameterized complexity of the repetition free longest common subsequence problem
- Faster algorithms for finding and counting subgraphs
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Title not available (Why is that?)
- Detours in directed graphs
- Finding and counting vertex-colored subtrees
- Finding Temporal Paths Under Waiting Time Constraints.
- Improved deterministic algorithms for weighted matching and packing problems
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
- Fast zeta transforms for lattices with few irreducibles
- Minimum \(k\)-path vertex cover
- Narrow sieves for parameterized paths and packings
- Nouvelle demonstration d'une congruence modulo 16 entre les nombres de classes d'ideaux de \(Q(\sqrt{-2p})\) et \(Q(\sqrt{2p})\) pour p premier = 1 (mod 4)
- Detecting monomials with \(k\) distinct variables
- Gerrymandering on graphs: computational complexity and parameterized algorithms
- Number of cycles of small length in a graph
- Planar \(k\)-path in subexponential time and polynomial space
- Long directed \((s,t)\)-path: FPT algorithm
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Clearing directed subgraphs by mobile agents. Variations on covering with paths
- Shortest two disjoint paths in polynomial time
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
- Mixing Color Coding-Related Techniques
- Parameterized complexity and subexponential-time computability
- Exact weight subgraphs and the \(k\)-sum conjecture
- Univariate ideal membership parameterized by rank, degree, and number of generators
- PTAS for minimum \(k\)-path vertex cover in ball graph
- Title not available (Why is that?)
- The Maximum Binary Tree Problem.
- Finding pathway structures in protein interaction networks
- A faster FPT algorithm for 3-path vertex cover
- Parameterized algorithms for list \(K\)-cycle
- Sublinear-time algorithms for counting star subgraphs via edge sampling
- Parameterized complexity and kernelizability of max ones and exact ones problems
- Finding temporal paths under waiting time constraints
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- Title not available (Why is that?)
- Computing Directed Pathwidth in O(1.89 n ) Time
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
Uses Software
This page was built for publication: Finding paths of length \(k\) in \(O^{*}(2^k)\) time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976105)
