G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU

DOI10.1007/978-3-030-85665-6_25MaRDI QIDQ6487196zbMATH OpenFDO

Authors Rajiv Gupta

Publication date 31 March 2022

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Parallel algorithms in computer science (68W10)

Recommendations

• Filtering for Subgraph Isomorphism
• AllDifferent-based filtering for subgraph isomorphism
• When subgraph isomorphism is really hard, and why this matters for graph databases
• Indexing with well-founded total order for faster subgraph isomorphism detection
• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs

Cites work

• An Algorithm for Subgraph Isomorphism
• Faster Subtree Isomorphism
• When subgraph isomorphism is really hard, and why this matters for graph databases

Cited in

(1)

• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs

This page was built for publication: G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487196)