Approximating Bandwidth by Mixing Layouts of Interval Graphs (Q4785694)
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 1848509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating Bandwidth by Mixing Layouts of Interval Graphs |
scientific article; zbMATH DE number 1848509 |
Statements
Approximating Bandwidth by Mixing Layouts of Interval Graphs (English)
0 references
5 January 2003
0 references
interval graphs
0 references
circular-arc graphs
0 references
chordal graphs
0 references
polygon graphs
0 references
bandwidth problem
0 references
approximation algorithm
0 references
0.9990387558937072
0 references
0.8219784498214722
0 references
0.805008053779602
0 references
