SQBC: an efficient subgraph matching method over large and dense graphs (Q903609): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2013.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164292538 / rank
 
Normal rank

Revision as of 22:55, 19 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
    0 references
    0 references
    0 references
    0 references
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers