Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978026115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar and grid graph reachability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation, matching, and counting uniform and nonuniform upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Planar Reachability Is in Unambiguous Log-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity, Determinants, Permanents, and (Unique) Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing LOGCFL certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow in Planar Graphs with Multiple Sources and Sinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796778 / rank
 
Normal rank

Latest revision as of 07:43, 3 July 2024

scientific article
Language Label Description Also known as
English
Deterministically isolating a perfect matching in bipartite planar graphs
scientific article

    Statements

    Deterministically isolating a perfect matching in bipartite planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    isolation lemma
    0 references
    deterministic isolation
    0 references
    perfect matching
    0 references
    planar graphs
    0 references
    NC
    0 references
    0 references