A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...

Graph algorithms constitute a pivotal component of modern computational science, underpinning diverse applications ranging from transportation optimisation and telecommunications to social network ...

We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a ...

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 ...

In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most of distributed and parallel graph algorithms in the MPC model are designed for static ...

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 ...

Solving the riddle can reduce electric car battery consumption and make life tougher for currency speculators in the future. The discovery has just won the award for best research article and was ...

Yesterday the IEEE announced an update to the 802.11 WiFi standard, and today it's promptly moving on to the Ethernet side of things. The association just approved the 802.1aq Shortest Path Bridging ...