Pages that link to "Item:Q5448767"

The following pages link to Point-to-Point Shortest Path Algorithms with Preprocessing (Q5448767):

Displayed 7 items.

• Efficient distributed computation of distance sketches in networks (Q748116) ‎ (← links)
• Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) ‎ (← links)
• Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network (Q1717836) ‎ (← links)
• Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216) ‎ (← links)
• Shortest-path queries in static networks (Q5176178) ‎ (← links)
• Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps (Q5391964) ‎ (← links)
• Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) ‎ (← links)