In 1994, Thomassen proved that every planar graph is 5-list-colorable. In 1995, Thomassen proved that every planar graph of girth at least five is 3-list-colorable. His proofs naturally lead to ...

Numerical computational science dominated the first half century of high- performance computing; graph theory served numerical linear algebra by enabling efficient sparse matrix methods. Turnabout is ...

Learn what graphs are, how to represent them in code, and how to apply some common graph algorithms to solve various problems in programming.

The GraphBLAS, Basic Linear Algebra Subprograms for Graphs, is a community-driven, open programming specification for graph analysis. The specification makes the development of high-performance graph ...

Learn what graph algorithms are, how they work, and how to use them for path planning, navigation, mapping, localization, and coordination in robotics.

A professor has helped create a powerful new algorithm that uncovers hidden patterns in complex networks, with potential uses in fraud detection, biology and knowledge discovery.

Graph Algorithms and Shortest Path Queries Publication Trend The graph below shows the total number of publications each year in Graph Algorithms and Shortest Path Queries.

Graph algorithms constitute a fundamental area of computational research that focuses on the analysis and manipulation of graph structures, which represent systems of interconnected entities.

Graph-Algorithm-Visualizer This program utilizes many different graph algorithms to efficiently find the shortest route between a start point and an endpoint. This tool will allow you to create your ...