Fixed-Parameter Tractability of Maximum Colored Path and Beyond

07/15/2022
by   Fedor V. Fomin, et al.
0

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 2^k n^O(1). This is the first FPT algorithm for this problem, and it generalizes the algorithm of Björklund, Husfeldt, and Taslaman [SODA 2012] on finding a path through k specified vertices. It also implies the first 2^k n^O(1) time algorithm for finding an (s,t)-path of length at least k. Our method yields FPT algorithms for even more general problems. For example, we consider the problem where the input consists of an n-vertex undirected graph G, a matroid M whose elements correspond to the vertices of G and which is represented over a finite field of order q, a positive integer weight function on the vertices of G, two sets of vertices S,T ⊆ V(G), and integers p,k,w, and the task is to find p vertex-disjoint paths from S to T so that the union of the vertices of these paths contains an independent set of M of cardinality k and weight w, while minimizing the sum of the lengths of the paths. We give a 2^p+O(k^2 log (q+k)) n^O(1) w time randomized algorithm for this problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2018

An O^*(2.619^k) algorithm for 4-path vertex cover

In the 4-path vertex cover problem, the input is an undirected graph G a...
research
04/14/2023

Finding A Path Of Length k: An Expository

Given a graph G(V, E) and a positive integer k (k ≥ 1), a simple path on...
research
05/01/2019

Reconfiguring Undirected Paths

We consider problems in which a simple path of fixed length, in an undir...
research
07/04/2023

Faster Detours in Undirected Graphs

The k-Detour problem is a basic path-finding problem: given a graph G on...
research
03/16/2021

On Linear Solution of "Cherry Pickup II". Max Weight of Two Disjoint Paths in Node-Weighted Gridlike DAG

"Minimum Falling Path Sum" (MFPS) is classic question in programming - "...
research
10/27/2020

The p-Airy distribution

In this manuscript we consider the set of Dyck paths equipped with the u...

Please sign up or login with your details

Forgot password? Click here to reset