The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2003.12.001 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088698934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501524 / 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: Random pseudo-polynomial algorithms for exact matroid problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of pfaffians / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlapping Pfaffians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: Q5501853 / 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: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity testing in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2003.12.001 / rank
 
Normal rank

Latest revision as of 11:44, 16 December 2024

scientific article
Language Label Description Also known as
English
The combinatorial approach yields an NC algorithm for computing Pfaffians
scientific article

    Statements

    The combinatorial approach yields an NC algorithm for computing Pfaffians (English)
    0 references
    0 references
    0 references
    0 references
    23 November 2004
    0 references
    Pfaffian
    0 references
    Matching
    0 references
    Combinatorics
    0 references
    Algorithm
    0 references
    NC
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references