[1]
Bannister, M. et al. 2015. The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. Journal of Graph Algorithms and Applications. 19, 2 (Nov. 2015), 619–656. DOI:https://doi.org/10.7155/jgaa.00349.