Finding maximal common subgraphs via time-space efficient reverse search

DOI10.1007/978-3-319-94776-1_28OpenAlexW2810739335MaRDI QIDQ1790989

Roberto Grossi, Andrea Marino, Luca Versari, Alessio Conte

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

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

Related Items (2)

Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ A fast discovery algorithm for large common connected induced subgraphs

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