Efficient Enumeration of Chordless Cycles

In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms have the advantage of finding each chordless cycle only onc...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2014-11
Main Authors: Elisângela Silva Dias, Castonguay, Diane, Longo, Humberto, Walid Abdala Rfaei Jradi
Format: Article
Language:English
Subjects:
Algorithms
Apexes
Enumeration
Graph theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Elisângela Silva Dias
Castonguay, Diane
Longo, Humberto
Walid Abdala Rfaei Jradi
description In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms have the advantage of finding each chordless cycle only once. To ensure this, we introduced the concepts of vertex labeling and initial valid vertex triplet. To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search in a subgraph obtained by the elimination of many of the vertices from the original graph. The resulting algorithm has time complexity \(\mathcal{O}(n + m)\) in the output size, where \(n\) is the number of vertices and \(m\) is the number of edges.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2085198362</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2085198362</sourcerecordid><originalsourceid>FETCH-proquest_journals_20851983623</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQdE1Ly0zOTM0rUXDNK81NLUosyczPU8hPU3DOyC9KyUktLlZwrkwG0jwMrGmJOcWpvFCam0HZzTXE2UO3oCi_sDS1uCQ-K7-0KA8oFW9kYGFqaGlhbGZkTJwqANp0MHk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2085198362</pqid></control><display><type>article</type><title>Efficient Enumeration of Chordless Cycles</title><source>Publicly Available Content Database</source><creator>Elisângela Silva Dias ; Castonguay, Diane ; Longo, Humberto ; Walid Abdala Rfaei Jradi</creator><creatorcontrib>Elisângela Silva Dias ; Castonguay, Diane ; Longo, Humberto ; Walid Abdala Rfaei Jradi</creatorcontrib><description>In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms have the advantage of finding each chordless cycle only once. To ensure this, we introduced the concepts of vertex labeling and initial valid vertex triplet. To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search in a subgraph obtained by the elimination of many of the vertices from the original graph. The resulting algorithm has time complexity \(\mathcal{O}(n + m)\) in the output size, where \(n\) is the number of vertices and \(m\) is the number of edges.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Apexes ; Enumeration ; Graph theory</subject><ispartof>arXiv.org, 2014-11</ispartof><rights>2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2085198362?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25731,36989,44566</link.rule.ids></links><search><creatorcontrib>Elisângela Silva Dias</creatorcontrib><creatorcontrib>Castonguay, Diane</creatorcontrib><creatorcontrib>Longo, Humberto</creatorcontrib><creatorcontrib>Walid Abdala Rfaei Jradi</creatorcontrib><title>Efficient Enumeration of Chordless Cycles</title><title>arXiv.org</title><description>In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms have the advantage of finding each chordless cycle only once. To ensure this, we introduced the concepts of vertex labeling and initial valid vertex triplet. To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search in a subgraph obtained by the elimination of many of the vertices from the original graph. The resulting algorithm has time complexity \(\mathcal{O}(n + m)\) in the output size, where \(n\) is the number of vertices and \(m\) is the number of edges.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Enumeration</subject><subject>Graph theory</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQdE1Ly0zOTM0rUXDNK81NLUosyczPU8hPU3DOyC9KyUktLlZwrkwG0jwMrGmJOcWpvFCam0HZzTXE2UO3oCi_sDS1uCQ-K7-0KA8oFW9kYGFqaGlhbGZkTJwqANp0MHk</recordid><startdate>20141127</startdate><enddate>20141127</enddate><creator>Elisângela Silva Dias</creator><creator>Castonguay, Diane</creator><creator>Longo, Humberto</creator><creator>Walid Abdala Rfaei Jradi</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20141127</creationdate><title>Efficient Enumeration of Chordless Cycles</title><author>Elisângela Silva Dias ; Castonguay, Diane ; Longo, Humberto ; Walid Abdala Rfaei Jradi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20851983623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Enumeration</topic><topic>Graph theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Elisângela Silva Dias</creatorcontrib><creatorcontrib>Castonguay, Diane</creatorcontrib><creatorcontrib>Longo, Humberto</creatorcontrib><creatorcontrib>Walid Abdala Rfaei Jradi</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Elisângela Silva Dias</au><au>Castonguay, Diane</au><au>Longo, Humberto</au><au>Walid Abdala Rfaei Jradi</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Efficient Enumeration of Chordless Cycles</atitle><jtitle>arXiv.org</jtitle><date>2014-11-27</date><risdate>2014</risdate><eissn>2331-8422</eissn><abstract>In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms have the advantage of finding each chordless cycle only once. To ensure this, we introduced the concepts of vertex labeling and initial valid vertex triplet. To guarantee that the expansion of a given chordless path will always lead to a chordless cycle, we use a breadth-first search in a subgraph obtained by the elimination of many of the vertices from the original graph. The resulting algorithm has time complexity \(\mathcal{O}(n + m)\) in the output size, where \(n\) is the number of vertices and \(m\) is the number of edges.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2014-11
issn 2331-8422
language eng
recordid cdi_proquest_journals_2085198362
source Publicly Available Content Database
subjects Algorithms
Apexes
Enumeration
Graph theory
title Efficient Enumeration of Chordless Cycles
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T15%3A19%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Efficient%20Enumeration%20of%20Chordless%20Cycles&rft.jtitle=arXiv.org&rft.au=Elis%C3%A2ngela%20Silva%20Dias&rft.date=2014-11-27&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2085198362%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20851983623%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2085198362&rft_id=info:pmid/&rfr_iscdi=true