Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397)

From MaRDI portal
Revision as of 21:40, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Deterministically isolating a perfect matching in bipartite planar graphs
scientific article

    Statements

    title
    Deterministically isolating a perfect matching in bipartite planar graphs (English)
    0 references
    author
    Samir Datta
    0 references
    Raghav Kulkarni
    0 references
    Sambuddha Roy
    0 references
    publication date
    6 October 2010
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C10
    0 references
    05C70
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5796572
    0 references
    zbMATH Keywords
    isolation lemma
    0 references
    deterministic isolation
    0 references
    perfect matching
    0 references
    planar graphs
    0 references
    NC
    0 references
    OpenAlex ID
    W1978026115
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1959397&oldid=31806032"
    Powered by MediaWiki