Line-distortion, bandwidth and path-length of a graph (Q521805)
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 6705189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Line-distortion, bandwidth and path-length of a graph |
scientific article; zbMATH DE number 6705189 |
Statements
Line-distortion, bandwidth and path-length of a graph (English)
0 references
12 April 2017
0 references
approximation algorithms
0 references
minimum line-distortion
0 references
minimum bandwidth
0 references
Robertson-Seymour's path-decomposition
0 references
path-length
0 references
AT-free graphs
0 references
0 references
0 references
0 references
0.9915754795074464
0 references
0.8107308149337769
0 references
0.8104807734489441
0 references
0.7993574738502502
0 references
0.787739098072052
0 references
