Backtrack search algorithms and the maximal common subgraph problem

DOI10.1002/spe.4380120103zbMath0466.68053OpenAlexW1974032838MaRDI QIDQ3919094

J. J. McGregor

Publication date: 1982

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380120103

zbMATH Keywords

chemical reactionssearch tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (16)

Different kinds of models to integrate the OR-expert's knowledge into decision support systems ⋮ Heuristics for the generalized median graph problem ⋮ Matching graphs with unique node labels ⋮ On generalization/specialization for conceptual graphs ⋮ Answering ``why empty? and ``why so many? queries in graph databases ⋮ Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem ⋮ Lattice complete graphs ⋮ Term-Graph Anti-Unification ⋮ Two metrics in a graph theory modeling of organic chemistry ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ Polyhedral study of the maximum common induced subgraph problem ⋮ Median graphs: A genetic approach based on new theoretical properties ⋮ Edit distance-based kernel functions for structural pattern classification ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms ⋮ On the approximation of largest common subtrees and largest common point sets

Cites Work

• Application of game tree searching techniques to sequential pattern recognition

This page was built for publication: Backtrack search algorithms and the maximal common subgraph problem