An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs (Q4296515)

From MaRDI portal
Revision as of 20:06, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    10 October 1994
    0 references
    interval graphs
    0 references
    bandwidth
    0 references
    algorithm
    0 references

    Identifiers