Pages that link to "Item:Q1087335"

The following pages link to Shortest paths in Euclidean graphs (Q1087335):

Displaying 17 items.

• Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
• A more realistic approach for airport ground movement optimisation with stand holding (Q490362) (← links)
• An O(NP) sequence comparison algorithm (Q912628) (← links)
• Solving k-shortest and constrained shortest path problems efficiently (Q918435) (← links)
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
• Classes of graphs which approximate the complete Euclidean graph (Q1186079) (← links)
• On sparse spanners of weighted graphs (Q1196368) (← links)
• An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
• A shortest-path algorithm for Manhattan graphs (Q1313705) (← links)
• A parallel bio-inspired shortest path algorithm (Q2218449) (← links)
• Heuristic shortest path algorithms for transportation applications: state of the art (Q2499162) (← links)
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622) (← links)
• A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS (Q2836524) (← links)
• Bidirectional A* search on time-dependent road networks (Q2892160) (← links)
• Shortest paths on dynamic graphs (Q3638853) (← links)
• Generating sparse spanners for weighted graphs (Q5056089) (← links)
• Shortest-path queries in static networks (Q5176178) (← links)