A finite-difference sieve to count paths and cycles by length

Information Processing Letters

Volumn 60, Issue 4, 1996, Pages 171-176

  Bax, Eric ^a   Franklin, Joel ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Combinatorial problems

Indexed keywords

ALGORITHMS; FINITE DIFFERENCE METHOD; GRAPH THEORY; POLYNOMIALS;

CYCLES; PATHS;

COMBINATORIAL MATHEMATICS;

EID: 0030287225     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00159-7     Document Type: Article

References (3)

1. E. Bax, Algorithms to count paths and cycles, Inform. Process. Lett. 52 (1994) 249-252.
2. E. Bax and J. Franklin, A finite-difference sieve to compute the permanent, Tech. Rept. CalTech-CS-TR-96-04.
3. R.M. Karp, Dynamic programming meets the principle of inclusion and exclusion, Oper. Res. Lett. 1 (2) (1982) 49-51.