Distributed graph pattern matching via bounded dual simulation

DOI10.1016/J.INS.2022.08.038MaRDI QIDQ6122273zbMATH OpenFDO

Authors Sarra Bouhenni, Saïd Yahiaoui, Nadia Nouali-Taboudjemat, H. Kheddouci

Publication date 27 March 2024

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

subgraph matchinggraph pattern matchingmassive graphsgraph simulationdistributed graph processing

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Recommendations

• Strong simulation: capturing topology in graph pattern matching
• Parallel algorithms for flexible pattern matching on big graphs
• Incremental graph pattern matching
• Distributed top-k subgraph matching
• SQL-based solution for fast graph similarity search

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1306878 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Parallel algorithms for flexible pattern matching on big graphs

Cited in

(1)

• Linking entities across relations and graphs

This page was built for publication: Distributed graph pattern matching via bounded dual simulation

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