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

The Journal of the Operational Research Society, Vol. 53, No. 10, Special Issue: Applications and Developments in Mathematical Programming (Oct., 2002), pp. 1109-1117 (9 pages) In the min-max loop ...

Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in this ...

Researchers from MIT, Yale University, and the University of Southern California have developed what they are labeling the "fastest known algorithm" for solving the problem of "maximum flow." The max ...