An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140)
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 6484647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal time algorithm for minimum linear arrangement of chord graphs |
scientific article; zbMATH DE number 6484647 |
Statements
An optimal time algorithm for minimum linear arrangement of chord graphs (English)
0 references
23 September 2015
0 references
minimum linear arrangement
0 references
graph layout
0 references
labeling
0 references
chord graph
0 references
0 references
0 references
0.9210214018821716
0 references
0.8141939640045166
0 references
0.8050079941749573
0 references
0.8045077323913574
0 references
0.8014554381370544
0 references
