Graph domination games represent a vibrant area of combinatorial game theory wherein two opponents engage in a strategic contest on the vertices of a graph. In the standard format, one player, known ...

Graph algorithms and spanners have emerged as a critical area of research in computer science, underpinning both theoretical advances and practical applications such as network design, routing ...

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