Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs

Résumé

Chordless cycles are very natural structures in undirected graphs, with an important history and distinguished role in graph theory. Motivated also by previous work on the classical problem of listing cycles, we study how to list chordless cycles. The best known solution to list all the C chordless cycles contained in an undirected graph G = (V,E) takes O(|E|2 + |E| ·C) time. In this paper we provide an algorithm taking Õ(|E|+|V|⋅C) time. We also show how to obtain the same complexity for listing all the P chordless st-paths in G (where C is replaced by P).
Fichier principal
Vignette du fichier
esa20140_submission_183.pdf (357.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01081031 , version 1 (30-05-2017)

Identifiants

Citer

Rui Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot. Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. 22th Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.418-429, ⟨10.1007/978-3-662-44777-2_35⟩. ⟨hal-01081031⟩
185 Consultations
281 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More