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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SAGA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GraphGrep / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Vehicle routing with a sparse feasibility graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Dense Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank

Latest revision as of 07:41, 11 July 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