Complexity of counting cycles using zeons
type: Item
instance of: scholarly article
title: Complexity of counting cycles using zeons
zbMATH Open document ID: 1231.05250
author: R. Schott
author: G. S. Staples
publication date: 2012-02-05T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6003369
zbMATH Keywords: cycles
zbMATH Keywords: counting
zbMATH Keywords: complexity
zbMATH Keywords: zeons
zbMATH Keywords: nilpoternt adjacency matrix method
zbMATH Keywords: count cycles
zbMATH Keywords: simple graphs
zbMATH Keywords: Bax
zbMATH Keywords: Tarjan
MaRDI profile type: Publication
full work available at URL: j.camwa.2011.06.026
OpenAlex ID: W2064268547
cites work: Reductions in computational complexity using Clifford algebras
cites work: Nilpotent adjacency matrices and random graphs.
cites work: Nilpotent adjacency matrices, random graphs and quantum random variables
cites work: Algorithms to count paths and cycles
cites work: A finite-difference sieve to count paths and cycles by length
cites work: Dynamic programming meets the principle of inclusion and exclusion
cites work: Q4142699
cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem
cites work: Enumeration of the Elementary Circuits of a Directed Graph
DOI: 10.1016/J.CAMWA.2011.06.026
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 6003369