Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
type: Item
instance of: scholarly article
title: Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
zbMATH Open document ID: 1423.68571
DOI: 10.1007/978-3-662-44777-2_35
author: Rui Ferreira
author: Roberto Grossi
author: Romeo Rizzi
author: Gustavo Sacomoto
author: Marie-France Sagot
published in: Algorithms - ESA 2014
publication date: 2014-10-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1408.1265
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6352768
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W99871796
arXiv ID: 1408.1265
Recommended article: Optimal Listing of Cycles and st-Paths in Undirected Graphs
Recommended article: Listing all fixed-length simple cycles in sparse graphs in optimal time
Recommended article: Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
Recommended article: Efficient approximation algorithms for shortest cycles in undirected graphs
Recommended article: Q4607979
Recommended article: A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Recommended article: Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
Recommended article: An efficient approximation algorithm for counting \(n\)-cycles in a graph
Recommended article: Q4215750
description: scientific article