Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562)

From MaRDI portal
Revision as of 14:48, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized complexity of the \(k\)-arc Chinese postman problem
scientific article

    Statements

    title
    Parameterized complexity of the \(k\)-arc Chinese postman problem (English)
    0 references
    author
    Mohammad Hasan
    0 references
    M. Dambrine
    0 references
    publication date
    14 November 2016
    0 references
    zbMATH Keywords
    mixed Chinese postman problem
    0 references
    fixed parameter tractable
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    90C27
    0 references
    90C35
    0 references
    zbMATH DE Number
    6652742
    0 references
    OpenAlex ID
    W1801151079
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q340562&oldid=38311249"
    Powered by MediaWiki