Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

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

A professor has helped create a powerful new algorithm that uncovers hidden patterns in complex networks, with potential uses in fraud detection, biology and knowledge discovery. University of ...

This note contains an O(n log n) time-bounded implementation and extentions for a procedure developed by Sidney for the two-machine maximum flow time problem with series-parallel precedence ...