The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings. (English) Zbl 1328.05128

Bannister, Michael J.; Devanny, William E.; Eppstein, David; Goodrich, Michael T.

J. Graph Algorithms Appl. 19, No. 2, 619-656 (2015).

Summary: 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. We formulate an abstract model of exact symbolic computation that augments algebraic computation trees with functions for computing radicals or roots of low-degree polynomials, and we show that this model cannot solve these graph drawing problems.

MSC:

05C62

Graph representations (geometric and intersection representations, etc.)

Keywords:

Galois theory; exact symbolic computation

Software:

CirclePack; LEDA; SageMath