Original scientific paper
https://doi.org/10.17535/crorr.2024.0016
Exact methods for the longest induced cycle problem
Ahmad Turki Anaqreh
; University of Szeged, Institute of Informatics, 6720 Szeged, Árpád tér 2, Hungary
*
Boglárka G.-Tóth
; University of Szeged, Institute of Informatics, 6720 Szeged, Árpád tér 2, Hungary
Tamás Vinkó
; University of Szeged, Institute of Informatics, 6720 Szeged, Árpád tér 2, Hungary
* Corresponding author.
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 that cannot be directly solved by any MILP solver. 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.
Keywords
branch-and-cut algorithm; longest chordless cycle; longest induced cycle; mixed integer linear programming; valid inequalities
Hrčak ID:
321261
URI
Publication date:
7.10.2024.
Visits: 0 *