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

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

Combined with algorithms that can handle such graphs it’s a great way to not only make the basic structure of a network clear, but also to model structures and systems.

Dr. Alin Deutsch of UC San Diego explains in a Q&A why graph database algorithms will become the driving force behind the next generation of AI and machine learning apps.