On linear algebraic algorithms for the subgraph matching problem and its variants

DOI10.1007/s11590-023-02001-zOpenAlexW4362723844MaRDI QIDQ6164954

Ilya A. Khlystov, Dmitriy S. Malyshev, O. O. Razvenskaya, Unnamed Author

Publication date: 28 July 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-023-02001-z

zbMATH Keywords

\(k\)-clique matching/counting problemlinear algebraic algorithmsubgraph matching/counting problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
• Finding and counting given length cycles
• On the complexity of fixed parameter clique and dominating set
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Efficient algorithms for clique problems
• Arboricity and bipartite subgraph listing algorithms
• Novel techniques to speed up the computation of the automorphism group of a graph
• Practical graph isomorphism. II.
• Clique Counting in MapReduce
• A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
• External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
• The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
• Arboricity and Subgraph Listing Algorithms
• Counting Triangles under Updates in Worst-Case Optimal Time
• Collective dynamics of ‘small-world’ networks

This page was built for publication: On linear algebraic algorithms for the subgraph matching problem and its variants