Exact Methods for the Longest Induced Cycle Problem
Discrete Mathematics
2023-11-28 v1
Abstract
The longest induced (or chordless) cycle problem is a graph problem classified as NP-complete and involves the task of determining the largest possible subset of vertices within a graph in such a way that the induced subgraph forms a cycle. Within this paper, we present three integer linear programs specifically formulated to yield optimal solutions for this problem. The branch-and-cut algorithm has been used for two models. To demonstrate the computational efficiency of these methods, we utilize them on a range of real-world graphs as well as random graphs. Additionally, we conduct a comparative analysis against approaches previously proposed in the literature.
Cite
@article{arxiv.2311.15899,
title = {Exact Methods for the Longest Induced Cycle Problem},
author = {Ahmad T. Anaqreh and Boglárka G. -Tóth and Tamás Vinkó},
journal= {arXiv preprint arXiv:2311.15899},
year = {2023}
}