Via Muthu: the list of accepted papers at the 2008 ACM-SIAM Symposium on Discrete Algorithms (SODA) is now available.
I'm happy to report that my own submission, the one on recognizing partial cubes, is among the accepts. So I'll see you all in San Francisco!
I landed here from looking for algorithms for the k-shortest paths problem, I did find your paper for digraphs as also the Katoh and the Hadjiconstantinou papers, the latter being more relevant since my aim is to find the paths in undirected graphs.
I was wondering if you knew of any existing implementations ?
TIA, and sorry if this is a bother
The implementations of my algorithm that I know of are linked from my pub page. But you might also want to look into Hershberger and Suri's paper on simple paths; the title implies that there's an implementation.
thank you David