On the Complexity of Cycle Enumeration for Simple Graphs

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

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

zbMATH Keywords

graded commutative algebranilpotent adjacency matrix methods

Mathematics Subject Classification ID

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

Related Items (3)

Listing all fixed-length simple cycles in sparse graphs in optimal time ⋮ A direct method for calculating cell cycles of a block map of a simple planar graph ⋮ Algorithmic complexity of finding cross-cycles in flag complexes

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)