Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism

DOI10.1145/1671970.1921702zbMath1284.68529DBLPjournals/jea/Ullmann10OpenAlexW2010532254WikidataQ56270752 ScholiaQ56270752MaRDI QIDQ5406228

Julian R. Ullmann

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1671970.1921702

zbMATH Keywords

constraint propagationconstraint satisfactionforward checkingbinary constraintssubgraph isomorphismdomain reductionsignature filegraph indexingbacktrackAllDifferent constraintbit-vectorfocus searchmolecule matchingprematching

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

An algorithm for weighted sub-graph matching based on gradient flows ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ Efficient subgraph matching using topological node feature constraints ⋮ VF2++ -- an improved subgraph isomorphism algorithm ⋮ The Secret Life of Keys: On the Calculation of Mechanical Lock Systems ⋮ Degree Reduction in Labeled Graph Retrieval

This page was built for publication: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism