Bit-Vector Algorithms for Binary Constraint Satisfaction and Subgraph Isomorphism

Journal of Experimental Algorithmics- United States

doi 10.1145/1671970.1921702

Full Text

Abstract

Available in

Date

Authors

Publisher

Association for Computing Machinery (ACM)

Related search

Algorithms for Constraint Satisfaction

INTELIGENCIA ARTIFICIAL
2003English

Lower Bounds for Subgraph Isomorphism

2019English

A Convex Relaxation Bound for Subgraph Isomorphism

International Journal of Combinatorics
2012English

Experimental Evaluation of Subgraph Isomorphism Solvers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns

English

The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

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

Efficient Subgraph Isomorphism Detection: A Decomposition Approach

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

A Subgraph Isomorphism Algorithm and Its Application to Biochemical Data

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

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

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy