The complexity of planarity testing (Q1887150)

From MaRDI portal
Revision as of 15:22, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The complexity of planarity testing
scientific article

    Statements

    title
    The complexity of planarity testing (English)
    0 references
    author
    Eric W. Allender
    0 references
    Meena Mahajan
    0 references
    publication date
    23 November 2004
    0 references
    zbMATH Keywords
    Planar graphs
    0 references
    Symmetric logspace
    0 references
    cites work
    Q4501524
    0 references
    Q3883524
    0 references
    Q3684121
    0 references
    Q2762791
    0 references
    Q5596083
    0 references
    Q4938661
    0 references
    Q4230323
    0 references
    Q4234059
    0 references
    Q5607111
    0 references
    Q4156452
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q15
    0 references
    68Q17
    0 references
    68R10
    0 references
    05C85
    0 references
    05C10
    0 references
    zbMATH DE Number
    2118415
    0 references
    OpenAlex ID
    W2028753111
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1887150&oldid=34375244"
    Powered by MediaWiki