Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

I have a 2D graph that I'm trying to lay out cleanly. Does anyone know of an algorithm that, given the x, y position of every node and the graph's edges will tell me how many edges cross. Right now I ...

I'm tasked to write a layout panel and library to display a directional left-right graph with a single source and sink node. Most of the documents I'm finding online are heavily detailed on the theory ...

The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

Graph crossing numbers quantify the minimum number of edge intersections in any planar drawing of a graph, an essential parameter in both theoretical and applied graph theory. The study of crossing ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...