InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex (Q2161751)

From MaRDI portal
Revision as of 19:15, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex
scientific article

    Statements

    InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2022
    0 references
    0 references
    influential node
    0 references
    subgraph matching
    0 references
    Kshell
    0 references
    0 references