Retrieval of similar pictures on pictorial databases
Pattern Recognition
An efficient representation for sparse sets
ACM Letters on Programming Languages and Systems (LOPLAS)
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Comparing trailing and copying for constraint programming
Proceedings of the 1999 international conference on Logic programming
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
On forward checking for non-binary constraint satisfaction
Artificial Intelligence
Programming language optimizations for modular router configurations
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Efficient Subgraph Isomorphism Detection: A Decomposition Approach
IEEE Transactions on Knowledge and Data Engineering
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
Probabilistic Relational Indexing
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constraint Satisfaction Problems: Backtrack Search Revisited
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Journal of the American Society for Information Science and Technology - Bioinformatics
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Feature-based similarity search in graph structures
ACM Transactions on Database Systems (TODS)
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
From chemical documentation to chemoinformatics: 50 years of chemical information science
Journal of Information Science
Optimization of Simple Tabular Reduction for Table Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A domain decomposition algorithm for constraint satisfaction
Journal of Experimental Algorithmics (JEA)
File searching using variable length keys
IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference
Chemoinformatics—an introduction for computer scientists
ACM Computing Surveys (CSUR)
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
GADDI: distance index based subgraph matching in biological networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
An Introduction to Chemoinformatics
An Introduction to Chemoinformatics
User-Guided Wrapping of PDF Documents Using Graph Matching Techniques
ICDAR '09 Proceedings of the 2009 10th International Conference on Document Analysis and Recognition
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Efficient graph automorphism by vertex partitioning
Artificial Intelligence
Summarization graph indexing: beyond frequent structure-based approach
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Constraint Networks: Techniques and Algorithms
Constraint Networks: Techniques and Algorithms
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
EGDIM: evolving graph database indexing method
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Constraint satisfaction over bit-vectors
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
A solution to a binary constraint satisfaction problem is a set of discrete values, one in each of a given set of domains, subject to constraints that allow only prescribed pairs of values in specified pairs of domains. Solutions are sought by backtrack search interleaved with a process that removes from domains those values that are currently inconsistent with provisional choices already made in the course of search. For each value in a given domain, a bit-vector shows which values in another domain are or are not permitted in a solution. Bit-vector representation of constraints allows bit-parallel, therefore fast, operations for editing domains during search. This article revises and updates bit-vector algorithms published in the 1970's, and introduces focus search, which is a new bit-vector algorithm relying more on search and less on domain-editing than previous algorithms. Focus search is competitive within a limited family of constraint satisfaction problems. Determination of subgraph isomorphism is a specialized binary constraint satisfaction problem for which bit-vector algorithms have been widely used since the 1980s, particularly for matching molecular structures. This article very substantially updates the author's 1976 subgraph isomorphism algorithm, and reports experimental results with random and real-life data.