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 ...
The computation of point-to-point shortest paths on time-dependent transportation networks has many practical applications. Finding the shortest path on transportation networks, taking into account ...
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 ...
An expository treatment of three network models most often encountered in Management Science applications: (i) The Shortest Path Problems, (ii) Flow Networks, and (iii) Activity Networks. In the first ...
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 ...
CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback