When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases (2018)
Attributed to:
Hard Graph Problems - Theory and in Practice
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1613/jair.5768
Publication URI: http://dx.doi.org/10.1613/jair.5768
Type: Journal Article/Review
Parent Publication: Journal of Artificial Intelligence Research