A general purpose algorithm for counting simple cycles and simple paths of any length.
Pierre-Louis GiscardNils M. KriegeRichard C. WilsonPublished in: CoRR (2016)
Keyphrases
- general purpose
- minimum length
- preprocessing
- learning algorithm
- times faster
- total length
- provably correct
- path length
- improved algorithm
- matching algorithm
- optimization algorithm
- experimental evaluation
- recognition algorithm
- computational cost
- search space
- cost function
- high accuracy
- simulated annealing
- input data
- detection algorithm
- computationally efficient
- single pass
- dynamic programming
- k means
- data streams
- computational complexity
- segmentation algorithm
- optimal solution
- bayesian networks
- genetic algorithm
- artificial neural networks
- tree structure
- theoretical analysis
- particle swarm optimization
- linear programming
- probabilistic model
- np hard