## Abstract

Let C be a proper minor-closed family of graphs. We present a randomized algorithm that given a graph G∈C 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)}nlogn time algorithm.

Original language | English |
---|---|

Pages (from-to) | 74-85 |

Number of pages | 12 |

Journal | Theoretical Computer Science |

Volume | 842 |

DOIs | |

State | Published - 24 Nov 2020 |

### Bibliographical note

Publisher Copyright:© 2020 Elsevier B.V.

## Keywords

- Linear time algorithm
- Minor-closed graph family
- Parameterized algorithm
- k-cycle

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science (all)

## Fingerprint

Dive into the research topics of 'A 2^{O(k)}n algorithm for k-cycle in minor-closed graph families'. Together they form a unique fingerprint.