A Faster Algorithm to Recognize Undirected Path Graphs.
Alejandro A. SchäfferPublished in: Discret. Appl. Math. (1993)
Keyphrases
- experimental evaluation
- learning algorithm
- dynamic programming
- times faster
- significant improvement
- matching algorithm
- k means
- computational complexity
- detection algorithm
- undirected graph
- preprocessing
- shortest path problem
- similarity measure
- optimization algorithm
- particle swarm optimization
- path finding
- path planning
- np hard
- search space
- graph model
- highly efficient
- recognition algorithm
- computational cost
- cost function
- optimal solution
- graph databases
- spanning tree
- memory efficient
- solution path
- weighted graph
- clustering method
- shortest path
- linear programming
- simulated annealing
- markov random field
- probabilistic model
- decision trees