Detecting and Counting Small Pattern Graphs (Q5502097): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Determinant Sums for Undirected Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic remark on algebraic program testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of fixed parameter clique and dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for finding and counting subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and listing induced paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting small induced subgraphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Detecting Small Subgraphs via Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four-Node Subgraphs in Triangle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, minimizing, and counting weighted subgraphs / rank
 
Normal rank

Latest revision as of 15:16, 10 July 2024

scientific article; zbMATH DE number 6472949
Language Label Description Also known as
English
Detecting and Counting Small Pattern Graphs
scientific article; zbMATH DE number 6472949

    Statements

    Detecting and Counting Small Pattern Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2015
    0 references
    subgraph and induced subgraph isomorphism
    0 references
    counting and detection of subgraphs
    0 references
    polynomial testing
    0 references
    exact algorithms
    0 references
    randomized algorithms
    0 references
    rectangular matrix multiplication
    0 references

    Identifiers

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