Graph polynomials serve as powerful invariants that encode both combinatorial and topological features of graphs drawn on surfaces. Beginning with the classical Tutte polynomial for planar graphs, ...

There are some open questions within the data visualization community as to what benefits the third dimension might add to visualizing information that doesn’t have an inherent spatial component.

If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...

Control flow is one of the simplest and most expressive representations of a program. Control flow is often represented as a control flow graph which contains an edge from statement A to B when there ...

MoSys announced that its Graph Memory Engine (GME) Accelerator IP is now running on Intel Stratix 10 FPGAs. The GME is part of MoSys’ Packet Classification Platform, and is capable of performing ...