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

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at ...

Thanks to their visual simplicity, bar graphs are popular tools for representing data. But do we really understand how to read them? New research from Wellesley College published in the Journal of ...

Definitions of expander graphs (edge expansion and spectral expansion), equivalence of definitions, the Alon-Boppana theorem, expansion of random graphs, ... Computer Science McCormick School of ...

Chien will lead a team of UChicago computer science researchers including Henry Hoffmann, Yanjing Li, and Michael Maire; the team also includes graph computing experts from Purdue University and ...