A 2^O(k)n algorithm for k-cycle in minor-closed graph families

by   Raphael Yuster, et al.

Let 𝒞 be a proper minor-closed family of graphs. We present a randomized algorithm that given a graph G ∈𝒞 with n vertices, finds a simple cycle of size k in G (if exists) in 2^O(k)n time. The algorithm applies to both directed and undirected graphs. In previous linear time algorithms for this problem, the runtime dependence on k is super-exponential. The algorithm can be derandomized yielding a 2^O(k)nlog n time algorithm.


page 1

page 2

page 3

page 4

∙ 03/01/2021

k-apices of minor-closed graph classes. I. Bounding the obstructions

Let G be a minor-closed graph class. We say that a graph G is a k-apex o...
∙ 04/27/2020

An FPT-algorithm for recognizing k-apices of minor-closed graph classes

Let G be a graph class. We say that a graph G is a k-apex of G if G cont...
∙ 05/21/2018

Fiding forbidden minors in sublinear time: a O(n^1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs

Let G be an undirected, bounded degree graph with n vertices. Fix a fini...
∙ 11/29/2021

A fast algorithm on average for solving the Hamilton Cycle problem

We present CertifyHAM, an algorithm which takes as input a graph G and e...
∙ 08/20/2020

Fast recognition of some parametric graph families

We identify all [1, λ, 8]-cycle regular I-graphs and all [1, λ, 8]-cycle...
∙ 05/18/2022

Reconfiguration of Digraph Homomorphisms

For a fixed graph H, the H-Recoloring problem asks whether for two given...
∙ 01/16/2020

Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours

New algorithms for generating closed knight's tours are obtained by gene...

Please sign up or login with your details

Forgot password? Click here to reset