An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Global total Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of dissimilar pfaffian orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double vertex-edge domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pfaffian orientations for a type of bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of convertible (0,1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pfaffian property of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pfaffian property of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pólya's permanent problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pfaffian graphs embedding on the torus / rank
 
Normal rank

Revision as of 11:12, 15 July 2024

scientific article
Language Label Description Also known as
English
An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
scientific article

    Statements

    An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 April 2018
    0 references
    Pfaffian orientation
    0 references
    perfect matching
    0 references
    bipartite graph
    0 references

    Identifiers