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

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

“The new algorithm is a remarkable tour de force,” said Giuseppe Italiano, a computer scientist at Luiss University and a co-author of the 1996 paper describing what is now the second-fastest ...

"Professor tackles graph mining challenges with new algorithm." ScienceDaily. ScienceDaily, 18 October 2024. <www.sciencedaily.com / releases / 2024 / 10 / 241018162554.htm>.

Collapsibility means that the same statistical result of interest can be obtained before and after marginalization over some variables. In this paper, we discuss three kinds of collapsibility for ...