Approximating Bandwidth by Mixing Layouts of Interval Graphs (Q4785694): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Latest revision as of 17:22, 5 March 2024
scientific article; zbMATH DE number 1848509
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
