SQBC: an efficient subgraph matching method over large and dense graphs (Q903609): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SING / rank | |||
Normal rank | |||
Revision as of 02:42, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SQBC: an efficient subgraph matching method over large and dense graphs |
scientific article |
Statements
SQBC: an efficient subgraph matching method over large and dense graphs (English)
0 references
14 January 2016
0 references
algorithm
0 references
large network
0 references
database
0 references
graph theory
0 references
subgraph isomorphism
0 references
index strategy
0 references
