An Algorithm Portfolio for the Sub-graph Isomorphism Problem

DOI10.1007/978-3-540-74446-7_8MaRDI QIDQ5429292zbMATH OpenOpenAlexFDO

Authors Franco Mascia, Roberto Battiti

Publication date 29 November 2007

Published in Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74446-7_8

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2097443
• Algorithms for subgraph isomorphism in graph pattern mining
• A new algorithm for induced subgraph isomorphism
• Efficient Suboptimal Graph Isomorphism
• Solving subgraph isomorphism problems with constraint programming

Cited in

(10)

• A new algorithm for induced subgraph isomorphism
• An algorithm using length-r paths to approximate subgraph isomorphism
• scientific article; zbMATH DE number 1941159 (Why is no real title available?)
• Algorithms for subgraph isomorphism in graph pattern mining
• scientific article; zbMATH DE number 2097443 (Why is no real title available?)
• Solving subgraph isomorphism problems with constraint programming
• AllDifferent-based filtering for subgraph isomorphism
• Parallel algorithm portfolios with adaptive resource allocation strategy
• Linear matching-time algorithm for the directed graph isomorphism problem
• VF2++ -- an improved subgraph isomorphism algorithm

This page was built for publication: An Algorithm Portfolio for the Sub-graph Isomorphism Problem

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