Parallel algorithms for flexible pattern matching on big graphs

DOI10.1016/J.INS.2018.01.018zbMATH Open1440.68194OpenAlexW2783228583MaRDI QIDQ2195447FDOQ2195447

Authors: Hongzhi Wang, Jianzhong Li, Hong Gao, Ning Li 

Publication date: 8 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.01.018

Recommendations

• scientific article; zbMATH DE number 1151367
• Parallel algorithms for combinatorial pattern matching
• Fast parallel graph searching with applications
• Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
• An efficient parallel graph edge matching algorithm and its applications
• An optimal parallel matching algorithm for cographs
• Efficient pattern matching on big uncertain graphs
• Massively Parallel Computation of Matching and MIS in Sparse Graphs
• An efficient parallel algorithm for maximum matching for some classes of graphs

zbMATH Keywords

distributed algorithmsstrong simulationgraph querygraph simulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Cites Work

• An Algorithm for Subgraph Isomorphism
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
• Title not available (Why is that?)

Cited In (3)

• Incremental graph pattern matching
• Motif discovery in networks: a survey
• Distributed graph pattern matching via bounded dual simulation

Uses Software

• MapReduce
• Gplag
• Pregel
• TALE

This page was built for publication: Parallel algorithms for flexible pattern matching on big graphs

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