Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Integration of AI and OR Techniques in Constraint Programming

• Publication date

  2018-06-26

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-93031-2_22
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Fixture Design Retrieving Method Based on Constrained Maximum Common Subgraph

  2018cited by this paper
• Between Subgraph Isomorphism and Maximum Common Subgraph

  2017cited by this paper
• A Partitioning Algorithm for Maximum Common Subgraph Problems

  2017cited by this paper
• Embarrassingly Parallel Search in Constraint Programming

  2016cited by this paper
• Portfolios of Subgraph Isomorphism Algorithms

  2016cited by this paper
• Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems

  2016influential reference
• On the Challenges of Using Social Media for Crisis Management

  2016cited by this paper
• TrGraph: Cross-Network Transfer Learning via Common Signature Subgraphs

  2015cited by this paper
• A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs

  2015cited by this paper
• A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem

  2015cited by this paper
• Comparing graphs

  2015cited by this paper
• On the subgraph epimorphism problem

  2014cited by this paper
• The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound

  2014influential reference
• Map Edit Distance vs. Graph Edit Distance for Matching Images

  2013cited by this paper
• An improved bit parallel exact maximum clique algorithm

  2011cited by this paper
• Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review

  2011cited by this paper
• Deriving common malware behavior through graph clustering

  2011cited by this paper
• CP Models for Maximum Common Subgraph Problems

  2011cited by this paper
• Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection

  2010cited by this paper
• Confidence-Based Work Stealing in Parallel Constraint Programming

  2009cited by this paper
• Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms

  2008cited by this paper
• BinHunt: Automatically Finding Semantic Differences in Binary Programs

  2008cited by this paper
• Parallel Algorithm Design for Branch and Bound

  2005cited by this paper
• A large database of graphs and its use for benchmarking graph isomorphism algorithms

  2003cited by this paper
• Benchmarking optimization software with performance profiles

  2001cited by this paper
• Specific Filtering Algorithms for Over-Constrained Problems

  2001cited by this paper
• A graph distance metric combining maximum common subgraph and minimum common supergraph

  2001cited by this paper
• On a relation between graph edit distance and maximum common subgraph

  1997cited by this paper
• IJCAI-95 : proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montréal, Québec, Canada, August 20-25, 1995

  1995cited by this paper
• Asynchronous Parallel Branch and Bound and Anomalies

  1995cited by this paper
• Limited Discrepancy Search

  1995cited by this paper
• Acceleration Anomalies in Parallel Branch and Bound Algorithms

  1994cited by this paper
• Substructure Discovery Using Minimum Description Length and Background Knowledge

  1993cited by this paper
• Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems

  1993cited by this paper
• Coping with Anomalies in Parallel Branch-and-Bound Algorithms

  1986cited by this paper
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs

  1973cited by this paper
• Promoting Access to White Rose Research Papers Maximum Common Subgraph Isomorphism Algorithms for the Matching of Chemical Structures

  year unknowncited by this paper
• Journal of Graph Algorithms and Applications Challenging Complexity of Maximum Common Subgraph Detection Algorithms: a Performance Analysis of Three Algorithms on a Wide Database of Graphs

  year unknowncited by this paper

• LAD2025, A constraint-based solver for the subgraph isomorphism problem

  2025cites this paper
• Practical Bigraphs via Subgraph Isomorphism

  2021cites this paper
• The Maximum Common Subgraph Problem: A Parallel and Multi-Engine Approach

  2020cites this paper
• Experimental Evaluation of Subgraph Isomorphism Solvers

  2019cites this paper
• Stress testing mixed integer programming solvers through new test instance generation methods

  2019cites this paper
• Sequential and Parallel Solution-Biased Search for Subgraph Algorithms

  2019influential citation
• The Maximum Common Subgraph Problem: A Portfolio Approach

  2019cites this paper