An algorithm that runs in time proportional to a polynomial function of the size of the input, considered efficient for solving problems. Bipartite Graph: A graph whose vertices can be divided ...

Graphs are everywhere ... mathematician László Babai made a breakthrough by proposing an algorithm that runs in "quasi-polynomial time." This comes quite close to the "polynomial-time" benchmark ...

shortest path and network flow graph algorithms; NP-completeness; approximation algorithms; number-theoretic algorithms; string matching; computational geometry. Additional topics may include linear ...