Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778)

From MaRDI portal
Revision as of 18:48, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
scientific article

    Statements

    Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    graphs of small treewidth
    0 references
    planar graphs
    0 references

    Identifiers