The Elementary Circuits of a Graph [H] (Algorithm 459).
Maciej M. SysloPublished in: Commun. ACM (1973)
Keyphrases
- learning algorithm
- significant improvement
- dynamic programming
- high accuracy
- optimization algorithm
- neural network
- preprocessing
- k means
- maximum flow
- times faster
- polynomial time complexity
- graph based algorithm
- minimum spanning tree
- matching algorithm
- expectation maximization
- particle swarm optimization
- worst case
- experimental evaluation
- np hard
- np complete
- segmentation algorithm
- detection algorithm
- graph partitioning
- computational cost
- depth first search
- graph construction
- optimal solution