Space complexity of perfect matching in bounded genus bipartite graphs (Q439936)

From MaRDI portal
Revision as of 14:21, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Space complexity of perfect matching in bounded genus bipartite graphs
scientific article

    Statements

    title
    Space complexity of perfect matching in bounded genus bipartite graphs (English)
    0 references
    author
    Samir Datta
    0 references
    Raghav Kulkarni
    0 references
    Raghunath Tewari
    0 references
    N. V. Vinodchandran
    0 references
    publication date
    17 August 2012
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C10
    0 references
    68Q15
    0 references
    05C70
    0 references
    zbMATH DE Number
    6067703
    0 references
    zbMATH Keywords
    space complexity
    0 references
    perfect matching
    0 references
    topological graph theory
    0 references
    OpenAlex ID
    W1496024985
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q439936&oldid=35293721"
    Powered by MediaWiki