SQBC: an efficient subgraph matching method over large and dense graphs

DOI10.1016/j.ins.2013.10.003zbMath1329.05289OpenAlexW2164292538MaRDI QIDQ903609

Xiang Lian, Huaming Zhang, Lei Zou, Dongyan Zhao, Wei Wang, Weiguo Zheng

Publication date: 14 January 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.10.003

zbMATH Keywords

algorithmdatabasegraph theorysubgraph isomorphismlarge networkindex strategy

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Note on two generalizations of the Randić index, Subgraph matching on temporal graphs

Uses Software

• TALE
• QNet
• GraphGrep
• Fg-index
• SAPPER
• GADDI
• SING
• SAGA

Cites Work

• The worst-case time complexity for generating all maximal cliques and computational experiments
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• An effective local search for the maximum clique problem
• Vehicle routing with a sparse feasibility graph
• A fast algorithm for the maximum clique problem
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• On Finding Dense Subgraphs
• An Algorithm for Subgraph Isomorphism