When Subgraph Isomorphism Is Really Hard, and Why This Matters for Graph Databases

Journal of Artificial Intelligence Research - United States
doi 10.1613/jair.5768
Full Text
Abstract

Available in full text

Date
Authors
Publisher

AI Access Foundation

Related search

Lipoproteins: When Size Really Matters

Current Opinion in Colloid and Interface Science
SurfacesPlasticsColloidInterfacesTheoretical ChemistryPolymersSurface ChemistryPhysical
2006English

Lower Bounds for Subgraph Isomorphism

2019English

A Convex Relaxation Bound for Subgraph Isomorphism

International Journal of Combinatorics
2012English

Dietary Treatments for Epilepsy: Why Is This So Hard for Us to Swallow?

Epilepsy Currents
Neurology
2016English

Bit-Vector Algorithms for Binary Constraint Satisfaction and Subgraph Isomorphism

Journal of Experimental Algorithmics
Theoretical Computer Science
2010English

Is This Really Pneumothorax?

Thorax
PulmonaryRespiratory Medicine
2009English

Experimental Evaluation of Subgraph Isomorphism Solvers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Efficient Subgraph Isomorphism Detection: A Decomposition Approach

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
2000English

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems

INFOR
Signal ProcessingComputer Science ApplicationsInformation Systems
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy