Generation of All the Cycles of a Graph from a Set of Basic Cycles [H] (Algorithm 492).
Norman E. GibbsPublished in: Commun. ACM (1975)
Keyphrases
- input data
- initial set
- dynamic programming
- optimization algorithm
- detection algorithm
- learning algorithm
- consistency check
- graph based algorithm
- equivalence class
- k means
- computational cost
- objective function
- random graphs
- solution space
- matching algorithm
- worst case
- optimal solution
- particle swarm optimization
- graph structure
- graph model
- undirected graph
- shortest path problem
- minimum spanning tree
- tree structure
- connected components
- image set
- np hard
- preprocessing
- computational complexity
- polynomial time complexity
- graph connectivity