A Convex Relaxation Bound for Subgraph Isomorphism

International Journal of Combinatorics
doi 10.1155/2012/908356
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Hindawi Limited

Related search

Lower Bounds for Subgraph Isomorphism

2019English

Efficient Subgraph Isomorphism Detection: A Decomposition Approach

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

Experimental Evaluation of Subgraph Isomorphism Solvers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Bit-Vector Algorithms for Binary Constraint Satisfaction and Subgraph Isomorphism

Journal of Experimental Algorithmics
Theoretical Computer Science
2010English

A Subgraph Isomorphism Algorithm and Its Application to Biochemical Data

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

A New Bound for the 2-Edge Connected Subgraph Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

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

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

A Convex Relaxation Approach for Computing Minimal Partitions

2009English

Semantic Ontology Method of Learning Resource Based on the Approximate Subgraph Isomorphism

Journal of Multimedia
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy