On linear algebraic algorithms for the subgraph matching problem and its variants (Q6164954): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs / 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: Arboricity and bipartite subgraph listing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended dynamic subgraph statistics using \(h\)-index parameterized data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Counting in MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: External-Memory Network Analysis Algorithms for Naturally Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Triangles under Updates in Worst-Case Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5198965 / 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: Main-memory triangle computations for very large (sparse (power-law)) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel techniques to speed up the computation of the automorphism group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 10:46, 2 August 2024

scientific article; zbMATH DE number 7720213
Language Label Description Also known as
English
On linear algebraic algorithms for the subgraph matching problem and its variants
scientific article; zbMATH DE number 7720213

    Statements

    On linear algebraic algorithms for the subgraph matching problem and its variants (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 July 2023
    0 references
    subgraph matching/counting problem
    0 references
    \(k\)-clique matching/counting problem
    0 references
    linear algebraic algorithm
    0 references

    Identifiers