Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

Now imagine that you want to insert a new edge connecting two nodes in a planar graph, say nodes 1 and 6 in the example below. To do so, you’re going to perform a series of flips. From the starting ...

Searching for the terms examples of misleading graphs or deceptive graphs is rarely the best way to find examples. A better way is to become familiar with graphical problems that cause a figure to ...

The Knowledge Graph just switched gear (perhaps 5 gears!). Please do consider the following examples. Not everyone is a winner. Freshness / Citation Recency ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

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.