SQBC: an efficient subgraph matching method over large and dense graphs (Q903609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6530452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SQBC: an efficient subgraph matching method over large and dense graphs |
scientific article; zbMATH DE number 6530452 |
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
0 references
0 references
0.7166645526885986
0 references
0.7083551287651062
0 references
0.6954602599143982
0 references
