Finding the optimal path over multi-cost graphs.

Yajun Yang Jeffrey Xu Yu Hong Gao Jianzhong Li

Published in: CIKM (2012)

Keyphrases

optimal path
path planning
shortest path
finding the shortest path
high cost
route planning
total cost
path planning algorithm
graph theoretic
bipartite graph
dijkstra algorithm
graph mining
minimum cost
graph databases
graph structures
series parallel
strongly connected
maximum clique
graph matching