Algorithms to count paths and cycles

Information Processing Letters

Volumn 52, Issue 5, 1994, Pages 249-252

  Bax, Eric T ^a  

^a Department of Computer Science California Institute of Technology 256 80 Pasadena CA 91125 USA ^*

Author keywords

Algorithms; Counting cycles

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS;

COMPLETE MATCHING; COUNTING CYCLES; HAMILTONIAN CYCLE; VERTEX;

ALGORITHMS;

EID: 0028769720     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(94)00151-0     Document Type: Article

References (8)

1. Inclusion and exclusion algorithm for the Hamiltonian path problem
2. Dynamic programming meets the principle of inclusion and exclusion
3. Carus Mathematical Monographs
4. Enumeration of the Elementary Circuits of a Directed Graph
5. The complexity of computing the permanent
6. The Complexity of Enumeration and Reliability Problems