On the Complexity of Cycle Enumeration for Simple Graphs

DOI10.1007/978-0-85729-811-9_12zbMATH Open1292.05141OpenAlexW2244596701MaRDI QIDQ4979428FDOQ4979428

Authors: R. Schott, G. S. Staples 

Publication date: 23 June 2014

Published in: Guide to Geometric Algebra in Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-85729-811-9_12

Recommendations

• An efficient approximation algorithm for counting \(n\)-cycles in a graph
• On the Number of Simple Cycles in Planar Graphs
• scientific article; zbMATH DE number 1107718
• Computational complexity of covering cyclic graphs
• LATIN 2004: Theoretical Informatics
• Counting cycles on planar graphs in subexponential time
• Cycles in graphs and related problems
• Estimating the number of short cycles in a simple planar graph

zbMATH Keywords

graded commutative algebranilpotent adjacency matrix methods

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cited In (6)

• A direct method for calculating cell cycles of a block map of a simple planar graph
• A general purpose algorithm for counting simple cycles and simple paths of any length
• Listing all fixed-length simple cycles in sparse graphs in optimal time
• Complexity of counting cycles using zeons
• Algorithmic complexity of finding cross-cycles in flag complexes
• Computational complexity reductions using Clifford algebras

This page was built for publication: On the Complexity of Cycle Enumeration for Simple Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979428)