Parallel algorithms for flexible pattern matching on big graphs
From MaRDI portal
(Redirected from Publication:2195447)
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
Cites work
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
- An Algorithm for Subgraph Isomorphism
Cited in
(4)
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)