There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

For example, you can change drawing A into drawing B by flipping the triangle made by nodes 1, 2 and 3 over the edge connecting nodes 2 and 3. The top section of drawing B can also be reflected over ...

Graph Colouring: The process of assigning colours to the vertices of a graph such that no two adjacent vertices share the same colour. Chromatic Number: The minimum number of colours required to ...

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.

What he really wants to look into is graph layout or graph drawing algorithms. There are a number of different approaches, so a search for the Wikipedia articles is a good starting point.

Today Memgraph, the streaming graph application platform, announced Memgraph 2.0, the public launch of its source-available platform, making it easy f ...

Graph isomorphism in quasipolynomial time I: The “Local Certificates Algorithm.” Combinatorics and Theoretical Computer Science seminar, Chicago, November 10, 2015.

Last I check, GraphViz cannot do rectangular routing (think flow chat), and instead it draws arcs or straight lines, so if your graph is hierarchical and wide, it'd come out like shit.

This podcast from the Department of Energy’s Exascale Computing Project (ECP) examines the ExaGraph Project, an ECP co-design center, tasked with developing efficient implementation of graph ...