FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted.

Hadas Shachnai Meirav Zehavi

Published in: CoRR (2014)

Keyphrases

weighted graph
edge weights
learning algorithm
shortest path
discrete data
search engine
computational complexity