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

DOI10.7155/jgaa.00349zbMath1328.05128OpenAlexW2033394837MaRDI QIDQ3460399

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

Publication date: 7 January 2016

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00349

zbMATH Keywords

Galois theoryexact symbolic computation

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

The Complexity of Drawing a Graph in a Polygonal Region ⋮ A linearized circle packing algorithm ⋮ Existence and hardness of conveyor belts ⋮ The complexity of drawing a graph in a polygonal region

Uses Software

• LEDA
• SageMath
• CirclePack

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