Spring algorithms and symmetry (Q4364590)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1088274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spring algorithms and symmetry |
scientific article; zbMATH DE number 1088274 |
Statements
23 February 1998
0 references
graph drawing
0 references
spring algorithm
0 references
graph automorphism
0 references
0.8957027792930603
0 references
0.7570683360099792
0 references
Spring algorithms and symmetry (English)
0 references
A spring algorithm takes a graph as input, simulates a system of springs defined on the graph, and outputs a drawing of the graph that corresponds with a locally minimum energy configuration. The paper formalizes the concept of graph symmetry, characterizes the types of symmetries, which can be displayed simultaneously by a graph drawing, and provides evidence of why spring algorithms can display graph symmetry. For the entire collection see [Zbl 0869.00027].
0 references