Determining the least expensive path for a new subway line underneath a metropolis like New York City is a colossal planning challenge—involving thousands of potential routes through hundreds of city ...

For non-planar graphs, such solutions are computationally intractable," explained the researchers. The algorithm relies on the Kac-Ward formalism, a mathematical method that allows exact computation ...