📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases (2018)

First Author: McCreesh C

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