The wide diameter of a graph is a natural generalization of diameter in a graph when we take account of the connectivity of the graph. In this paper, we define the generalized wide diameter of a graph ...

A couple of weeks ago, I attended and spoke at the first stop in the Neo4j GraphTour in Washington D.C. and I was able to get the best answer yet to a question that I’d been pondering: what’s the ...

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