Finding maximal common subgraphs via time-space efficient reverse search

DOI10.1007/978-3-319-94776-1_28MaRDI QIDQ1790989zbMATH OpenOpenAlexFDO

Authors Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari

Publication date 4 October 2018

Full work available at URL https://hal.inria.fr/hal-01964709/file/main%202.pdf

zbMATH Keywords

maximum common subgraph problemcommon subgraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)

Recommendations

• Graph-Based Representations in Pattern Recognition
• Enumerating all connected maximal common subgraphs in two graphs
• Computing and Combinatorics
• An improved maximum common induced subgraph solver
• Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms

Cited in

(8)

• Enumerating all connected maximal common subgraphs in two graphs
• Proximity Search for Maximal Subgraph Enumeration
• Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
• Observations from parallelising three maximum common (connected) subgraph algorithms
• A fast discovery algorithm for large common connected induced subgraphs
• An improved maximum common induced subgraph solver
• Graph-Based Representations in Pattern Recognition
• Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms

This page was built for publication: Finding maximal common subgraphs via time-space efficient reverse search

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