Amanote Research
Register
Sign In
Lower Bounds for Subgraph Isomorphism
doi 10.1142/9789813272880_0187
Full Text
Open PDF
Abstract
Available in
full text
Date
May 1, 2019
Authors
BENJAMIN ROSSMAN
Publisher
WORLD SCIENTIFIC
Related search
A Convex Relaxation Bound for Subgraph Isomorphism
International Journal of Combinatorics
Experimental Evaluation of Subgraph Isomorphism Solvers
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficient Subgraph Isomorphism Detection: A Decomposition Approach
IEEE Transactions on Knowledge and Data Engineering
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Bit-Vector Algorithms for Binary Constraint Satisfaction and Subgraph Isomorphism
Journal of Experimental Algorithmics
Theoretical Computer Science
Nearly Tight Bounds for Testing Function Isomorphism
A Subgraph Isomorphism Algorithm and Its Application to Biochemical Data
BMC Bioinformatics
Biochemistry
Applied Mathematics
Computer Science Applications
Structural Biology
Molecular Biology
When Subgraph Isomorphism Is Really Hard, and Why This Matters for Graph Databases
Journal of Artificial Intelligence Research
Artificial Intelligence
Lower Bounds
Semantic Ontology Method of Learning Resource Based on the Approximate Subgraph Isomorphism
Journal of Multimedia