Parallel algorithms for flexible pattern matching on big graphs (Q2195447)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel algorithms for flexible pattern matching on big graphs |
scientific article; zbMATH DE number 7245101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for flexible pattern matching on big graphs |
scientific article; zbMATH DE number 7245101 |
Statements
Parallel algorithms for flexible pattern matching on big graphs (English)
0 references
8 September 2020
0 references
graph query
0 references
graph simulation
0 references
distributed algorithms
0 references
strong simulation
0 references
0 references
0.9177622
0 references
0.9017346
0 references
0.89890975
0 references
0.89662004
0 references
0 references
0.8953674
0 references
0.89445627
0 references
