The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (Q3460399): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEDA / rank | |||
Normal rank | |||
Revision as of 09:26, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings |
scientific article |
Statements
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (English)
0 references
7 January 2016
0 references
Galois theory
0 references
exact symbolic computation
0 references
