Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential, they ...

The new algorithm checks planarity in a number of steps proportional to the cube of the logarithm of the number of nodes in the graph — an exponential improvement. Holm and Rotenberg, a computer ...

Graph isomorphism in quasipolynomial time I: The “Local Certificates Algorithm.” Combinatorics and Theoretical Computer Science seminar, Chicago, November 10, 2015.

Market design and stable matching theory form the cornerstone of modern economic mechanism design, addressing the fundamental challenge of allocating scarce resources amid complex and often ...

Many algorithms can readily find the optimal number of cuts for a given graph. ... Graph theory may show how individuals are connected, for example, but not capture the ways in which clusters of ...

The graph below shows the total number of publications each year in Market Design and Stable Matching Theory. References [1] A Theory of Simplicity in Games and Mechanism Design .