Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070)

From MaRDI portal
Revision as of 21:51, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Eulerian disjoint paths problem in grid graphs is NP-complete
scientific article

    Statements

    title
    Eulerian disjoint paths problem in grid graphs is NP-complete (English)
    0 references
    author
    Dániel Marx
    0 references
    publication date
    23 November 2004
    0 references
    zbMATH Keywords
    Disjoint paths
    0 references
    Grids
    0 references
    NP-completeness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C45
    0 references
    05C38
    0 references
    68R10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    2118353
    0 references
    OpenAlex ID
    W2010748366
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1887070&oldid=32055952"
    Powered by MediaWiki