An analysis of some linear graph layout heuristics (Q2491338)
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 5028032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An analysis of some linear graph layout heuristics |
scientific article; zbMATH DE number 5028032 |
Statements
An analysis of some linear graph layout heuristics (English)
0 references
29 May 2006
0 references
Heuristic
0 references
Approximation algorithm
0 references
Crossing number
0 references
Linear graph layout
0 references
0 references
0.9085139632225036
0 references
0.8541749119758606
0 references
0.8355773091316223
0 references
0.8163994550704956
0 references
0.7832126021385193
0 references
