When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases (Q4639034)
From MaRDI portal
scientific article; zbMATH DE number 6865760
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases |
scientific article; zbMATH DE number 6865760 |
Statements
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases (English)
0 references
2 May 2018
0 references
