A Fast Graph Traversal Algorithm for the Computer Enumeration of P-V Paths of Benzenoid Graphs.
Musiri M. BalakrishnarajanPonnambalam VenuvanalingamPublished in: Comput. Chem. (1995)
Keyphrases
- optimization algorithm
- dynamic programming
- preprocessing
- detection algorithm
- objective function
- computational complexity
- k means
- times faster
- computational cost
- theoretical analysis
- learning algorithm
- probabilistic model
- experimental evaluation
- convergence rate
- finding the shortest path
- graph model
- expectation maximization
- segmentation algorithm
- particle swarm optimization
- search space
- high accuracy
- matching algorithm
- path planning
- cost function
- recognition algorithm
- optimal solution
- graph partitioning
- graph clustering
- graph isomorphism
- feature selection