SQBC: an efficient subgraph matching method over large and dense graphs
type: Item
instance of: scholarly article
title: SQBC: an efficient subgraph matching method over large and dense graphs
zbMATH Open document ID: 1329.05289
author: Weiguo Zheng
author: Lei Zou
author: Xiang Lian
author: Huaming Zhang
author: Wei Wang
author: Dongyan Zhao
published in: Information Sciences
publication date: 2016-01-14T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6530452
zbMATH Keywords: algorithm
zbMATH Keywords: large network
zbMATH Keywords: database
zbMATH Keywords: graph theory
zbMATH Keywords: subgraph isomorphism
zbMATH Keywords: index strategy
describes a project that uses: TALE
describes a project that uses: QNet
describes a project that uses: Fg-index
describes a project that uses: SAPPER
describes a project that uses: GADDI
describes a project that uses: SING
describes a project that uses: SAGA
describes a project that uses: GraphGrep
MaRDI profile type: Publication
full work available at URL: j.ins.2013.10.003
OpenAlex ID: W2164292538
cites work: Vehicle routing with a sparse feasibility graph
cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem
cites work: An effective local search for the maximum clique problem
cites work: On Finding Dense Subgraphs
cites work: A fast algorithm for the maximum clique problem
cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
cites work: An Algorithm for Subgraph Isomorphism
DOI: 10.1016/J.INS.2013.10.003
description: scientific article; zbMATH DE number 6530452