Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights.

Published in: CPAIOR (2004)

Keyphrases

edge weights
shortest path
directed acyclic graph
weighted graph
social networks
spanning tree
similarity measure
feature space
high dimensional
hidden markov models
np hard
similarity search
directed graph
bipartite graph