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.

Graph algorithms can be used in programming to model and solve various real-world problems, such as network routing, social network analysis, recommendation systems, ...

Learn how to detect, avoid, or exploit negative cycles or weights in graph algorithms, and what are some common applications and techniques for shortest paths and maximum flows.

The new algorithm checks planarity in a number of steps proportional to the cube of the logarithm of the number of nodes in the graph — an exponential improvement. Holm and Rotenberg, a computer ...

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

Babai’s proposed algorithm doesn’t bring graph isomorphism all the way into P, but it comes close. It is quasi-polynomial, he asserts, which means that for a graph with n nodes, the algorithm’s ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential, they ...

A walk of length n − 1 that starts from s and ends at t can be viewed as a string of length 2n − 1 with alternating and possibly ... D. Small maximal independent sets and faster exact graph coloring.