The Elementary Circuits of a Graph (Remark on Algorithm 459).
Maciej M. SysloPublished in: Commun. ACM (1975)
Keyphrases
- learning algorithm
- dynamic programming
- experimental evaluation
- np hard
- computational complexity
- significant improvement
- maximum flow
- cost function
- similarity measure
- shortest path problem
- graph structure
- random walk
- high accuracy
- search space
- preprocessing
- optimal solution
- detection algorithm
- times faster
- graph model
- spanning tree
- graph based algorithm
- k means
- simulated annealing
- graph representation
- depth first search
- objective function