Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

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.

share|improve this question
Is your question what heuristics are there to find a tree decomposition, or what heuristics are there to find the shortest paths given that you have a tree decomposition? –  Luke Mathieson Jan 8 '13 at 0:54
yah. i suppose to know about heuristics to find the shortest paths given i have a tree decomposition. –  NRK Jan 8 '13 at 16:09
@jonsca thanks for ur editing. –  NRK Jan 8 '13 at 16:14

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.