Exact methods for the longest induced cycle problem

Authors

  • Ahmad Turki Anaqreh University of Szeged, Institute of Informatics, 6720 Szeged, Árpád tér 2, Hungary
  • Boglarka G.-Toth University of Szeged, Institute of Informatics, 6720 Szeged, Árpád tér 2, Hungary
  • Tamas Vinko University of Szeged, Institute of Informatics, 6720 Szeged, Árpád tér 2, Hungary

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.

Downloads

Published

2024-10-07

Issue

Vol. 15 No. 2 (2024): CRORR

Section

CRORR Journal Regular Issue

License

- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal

- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).