A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length
- 15 February 2019
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 81 (7) , 2716-2737
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Royal Commission for the Exhibition of 1851 (Research Fellowship 2015)
- Deutsche Forschungsgemeinschaft (Collaborative Research Center SFB 876, project A6)
This publication has 26 references indexed in Scilit:
- Complexity of counting cycles using zeonsComputers & Mathematics with Applications, 2011
- What's in a crowd? Analysis of face-to-face behavioral networksJournal of Theoretical Biology, 2011
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- A finite-difference sieve to count paths and cycles by lengthInformation Processing Letters, 1996
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Algorithms to count paths and cyclesInformation Processing Letters, 1994
- Single-hook characters and hamiltonian circuits∗Linear and Multilinear Algebra, 1983
- Dynamic programming meets the principle of inclusion and exclusionOperations Research Letters, 1982
- The complexity of computing the permanentTheoretical Computer Science, 1979
- The problem of isolating and countingUkrainian Mathematical Journal, 1978