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

The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. For decades, the graph isomorphism problem has held a special status within complexity theory. While ...

Graph analytics is a hot topic, but what does it mean? At the DC GraphTour, I learned the difference between graph queries, graph algorithms, and graph analytics. Next up: San Francisco GraphTour.

The graph database has not just had a stunningly successful first ten plus years, but looks set to be a major player in the way we work with complex data for a long time to come.