Algorithms to count paths and cycles
type: Item
instance of: scholarly article
title: Algorithms to count paths and cycles
zbMATH Open document ID: 0815.68077
DOI: 10.1016/0020-0190(94)00151-0
author: Eric Bax
published in: Information Processing Letters
publication date: 1994-12-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 699129
zbMATH Keywords: counting cycles
zbMATH Keywords: Hamiltonian cycles
zbMATH Keywords: paths
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00151-0
OpenAlex ID: W2059105688
cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem
cites work: Q4198056
cites work: Dynamic programming meets the principle of inclusion and exclusion
cites work: Q3851094
cites work: Enumeration of the Elementary Circuits of a Directed Graph
cites work: The complexity of computing the permanent
cites work: The Complexity of Enumeration and Reliability Problems
description: scientific article; zbMATH DE number 699129