Listing all fixed-length simple cycles in sparse graphs in optimal time
type: Item
instance of: scholarly article
title: Listing all fixed-length simple cycles in sparse graphs in optimal time
zbMATH Open document ID: 1495.68180
DOI: 10.1007/978-3-662-55751-8_28
author: George Manoussakis
publication date: 2017-11-22T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6810966
zbMATH Keywords: sparse graphs
zbMATH Keywords: \(k\)-degenerate
zbMATH Keywords: fixed-size cycles listing
MaRDI profile type: Publication
full work available at URL: 978-3-662-55751-8 28
OpenAlex ID: W2747682218
Recommended article: Optimal Listing of Cycles and st-Paths in Undirected Graphs
Recommended article: Approximating the Longest Cycle Problem in Sparse Graphs
Recommended article: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Recommended article: On the Complexity of Cycle Enumeration for Simple Graphs
Recommended article: Cycle lengths in sparse graphs
Recommended article: A Lower Bound on Cycle-Finding in Sparse Digraphs
Recommended article: Q4607968
Recommended article: Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
Recommended article: Efficient approximation algorithms for shortest cycles in undirected graphs
description: scientific article; zbMATH DE number 6810966