An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs (Q4296515)
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 591217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs |
scientific article; zbMATH DE number 591217 |
Statements
An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs (English)
0 references
10 October 1994
0 references
interval graphs
0 references
bandwidth
0 references
algorithm
0 references
0.8612381219863892
0 references
0.8511605858802795
0 references
0.848039984703064
0 references
0.8477664589881897
0 references
