What kind of heuristics are useful in a tree decomposition of a graph to find the k shortest paths from a given source to a vertex?
Moreover, the local shortest paths at each node in a tree are precomputed. Here, the graph is undirected and weighted. I'm interested in finding only simple paths, i.e., no nodes are repeated in a path.