On Wednesday 30 July 2008, Vojtech Brtnik wrote: > 1) Do you know of any database of scientific articles on the topic of > routing? I can't find any. I mean shortest path in huge graphs, > quickest path, finding nearest...., most comfortable path... etc,
Exactly one year ago, Artem Pavlenko gave some pointers: http://lists.openstreetmap.org/pipermail/talk/2007-July/016508.html > generating of traffic problem,... representing/saving huge graphs in > memory/HDD... If you want to go in the direction of I/O-efficient algorithms, this might be a good first pointer: http://www.springer.com/computer/foundations/book/978-3-540-00883-5 It is available online if you have access to Springer. See for example chapter 4: "Elementary Graph Algorithms in External Memory". -- Freek _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/routing
