Backtrack search algorithms and the maximal common subgraph problem

DOI10.1002/SPE.4380120103MaRDI QIDQ3919094zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Application of game tree searching techniques to sequential pattern recognition

Cited in

(17)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919094)