Fixed-Parameter Tractability of Maximum Colored Path and Beyond

  title={Fixed-Parameter Tractability of Maximum Colored Path and Beyond},
  author={F. Fomin and Petr A. Golovach and Tuukka Korhonen and Kirill Simonov and Giannos Stamoulis},
We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as follows. We give a randomized algorithm, that given a colored n-vertex undirected graph, vertices s and t, and an integer k, finds an (s, t)-path containing at least k different colors in time 2knO(1). This is the first FPT algorithm for this problem, and it… 



Graphs and Geometry

Color Coding

These findings suggest that a reliable unidimensional hue code should not contain more than about tight optimally spaced stimuli, whereas color codes are valuable in decreasing search-time with locate-type tasks.

Determinant Sums for Undirected Hamiltonicity

  • Andreas Björklund
  • Computer Science, Mathematics
    2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
A Monte Carlo algorithm for Hamilton city detection in an $n$-vertex undirected graph running in $O*(1.657^{n})$ time is presented, which is the first super polynomial improvement on the worst case runtime for the problem since the O^*(2^n) bound established for TSP almost fifty years ago.

Shortest cycle through specified elements

We give a randomized algorithm that finds a shortest simple cycle through a given set of k vertices or edges in an n-vertex undirected graph in time 2knO(1).

A randomized algorithm for long directed cycle

Mixing Color Coding-Related Techniques

This work presents a novel family of strategies for applying mixtures of representative sets and narrow sieves, and a general framework for speeding-up the previous best deterministic algorithms for k-Path, k-Tree, r-Dimensional k-Matching, Graph Motif and Partial Cover.

Splitters and near-optimal derandomization

A fairly general method for finding deterministic constructions obeying k-restrictions, which yields structures of size not much larger than the probabilistic bound and imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/Spl Sigma/ threshold formulae.

A parameterized view on matroid optimization problems

  • D. Marx
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2006

Narrow sieves for parameterized paths and packings

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane

The first constant factor approximation algorithm is given for the minimum number of obstacles touched by a path connecting s and t, resolving an open problem of [Chan and Kirkpatrick, TCS, 2014] and [Bandyapadhyay et al., CGTA, 2020].