Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.

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 d… ...

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

In this paper, we describe three graph theoretic heuristics that attempt to determine an optimal planar adjacency graph from a REL chart. Our computational experience suggests that these methods can ...

In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee. In an arXiv preprint, researchers from the Kwan Group at the Institute of Science and Technology ...

We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite ...

In this video from the PASC16 conference, Andrew Lumsdaine from Indiana University presents: Context Matters: Distributed Graph Algorithms and Runtime Systems. "The increasing complexity of the ...

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.