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
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q178860 / rank | |||
| Property / author | |||
| Property / author: Michael T. Goodrich / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEDA / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SageMath / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CirclePack / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.7155/jgaa.00349 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033394837 / rank | |||
Normal rank | |||
Latest revision as of 21:27, 19 March 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
