Although simple route planning is not as daunting as TSP, there are some similarities, in that it involves a weighted, undirected graph, requiring the algorithm to take into account the cost of ...

A project headed by the SEI’s Scott McMillan took a step in 2020 toward standardizing graph algorithm application development in C++.

In their 2019 paper Holm and Rotenberg found that some drawings provide a more advantageous starting position for inserting an edge than others. These “good” drawings are only a few flips away from ...

In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This ...

Asynchronous iterative algorithms have emerged as a robust alternative to traditional synchronous methods for solving large-scale linear systems. These approaches allow individual computational ...

The author presents a rapidly convergent algorithm to solve the general portfolio problem of maximizing concave utility functions subject to linear constraints. The algorithm is based on an iterative ...