An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs (Q4296515): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:12, 5 March 2024
scientific article; zbMATH DE number 591217
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
