The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings

TL;DR

This paper uses Galois theory to explain why many graph drawing methods rely on numerical approximations rather than exact algebraic solutions, due to the mathematical complexity of their solutions.

Contribution

It demonstrates that solutions to common graph drawing problems often cannot be expressed algebraically, explaining the ubiquity of numerical methods.

Findings

Many graph drawing solutions are algebraically unsolvable with radicals.

Numerical methods are essential due to algebraic intractability.

Galois theory provides a theoretical foundation for this computational limitation.

Abstract

Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain this phenomenon, we use Galois theory to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials. Hence, such solutions cannot be computed exactly even in extended computational models that include such operations.