Graph Algorithms and Shortest Path Queries Publication Trend The graph below shows the total number of publications each year in Graph Algorithms and Shortest Path Queries.

Military Operations Research, Vol. 14, No. 3 (2009), pp. 31-52 (22 pages) We formulate and solve aircraftrouting problems that arise when planning missions for military aircraft that are subject to ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network ...

One is to find the shortest elementary path from n 1 to n p, which is constrained to visit all nodes in S. The other is to find the shortest path (not necessarily elementary) under the same condition.

There is a new sorting algorithm a deterministic O (m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Starting with a matching problem, we will first discuss the three central tasks of algorithm design: correctness, termination, and efficiency. Following a similar design process, we will design ...

Also known as Shortest Path Bridging (SPB), the standard will help dramatically reduce the complexity of Ethernet networks while increasing their scale.

A new technique for solving 'graph Laplacians' is drastically simpler than its predecessors, with implications for a huge range of practical problems.