Complexity of counting cycles using zeons

DOI10.1016/j.camwa.2011.06.026zbMath1231.05250OpenAlexW2064268547MaRDI QIDQ660812

René Schott, George Stacey Staples

Publication date: 5 February 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.06.026

zbMATH Keywords

complexitycyclescountingBaxcount cyclesnilpoternt adjacency matrix methodsimple graphsTarjanzeons

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ A Hopf algebra for counting cycles ⋮ Enumerating simple paths from connected induced subgraphs ⋮ Zeon and idem-Clifford formulations of hypergraph problems

Cites Work

• Unnamed Item
• Unnamed Item
• A finite-difference sieve to count paths and cycles by length
• Inclusion and exclusion algorithm for the Hamiltonian path problem
• Reductions in computational complexity using Clifford algebras
• Dynamic programming meets the principle of inclusion and exclusion
• Algorithms to count paths and cycles
• Enumeration of the Elementary Circuits of a Directed Graph
• Nilpotent adjacency matrices, random graphs and quantum random variables

This page was built for publication: Complexity of counting cycles using zeons