BANNISTER, Michael; DEVANNY, William; EPPSTEIN, David; GOODRICH, Michael. 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, [S. l.], v. 19, n. 2, p. 619–656, 2015. DOI: 10.7155/jgaa.00349. Disponível em: https://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper349. Acesso em: 22 dec. 2024.