Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs (Q3586119)

From MaRDI portal
Revision as of 21:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs
scientific article

    Statements

    Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs (English)
    0 references
    0 references
    3 September 2010
    0 references
    subexponential algorithms
    0 references
    graph minors
    0 references
    odd minors
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references