Approximating Bandwidth by Mixing Layouts of Interval Graphs (Q4785694)

From MaRDI portal
Revision as of 17:22, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references