SLF: a passive parallelization of subgraph isomorphism

DOI10.1016/J.INS.2022.12.033MaRDI QIDQ6492611zbMATH OpenFDO

Authors Wenle Liang, Wenyong Dong, Mengting Yuan

Publication date 25 April 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2022.12.033

zbMATH Keywords

parallel algorithmsubgraph isomorphismtree search

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• AllDifferent-based filtering for subgraph isomorphism
• An Algorithm for Subgraph Isomorphism
• Scheduling multithreaded computations by work stealing
• Sequential and parallel solution-biased search for subgraph algorithms
• Solving subgraph isomorphism problems with constraint programming
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• VF2++ -- an improved subgraph isomorphism algorithm

This page was built for publication: SLF: a passive parallelization of subgraph isomorphism

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