Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem

DOI10.18255/1818-1015-2023-2-128-139MaRDI QIDQ6081679zbMATH OpenFDO

Authors Vladimir Vasilevich Vasilchikov

Publication date 5 October 2023

Published in Modeling and Analysis of Information Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://mathnet.ru/eng/mais794

zbMATH Keywords

.NETisomorphismmaximum common subgraphparallel algorithmrecursion

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites work

• Algorithm 457: finding all cliques of an undirected graph
• Backtrack search algorithms and the maximal common subgraph problem
• Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
• scientific article; zbMATH DE number 3827200 (Why is no real title available?)
• Parallel Algorithm for Solving the Graph Isomorphism Problem

Cited in

(2)

• Sequential and parallel solution-biased search for subgraph algorithms
• A branch \& cut algorithm for the maximum common edge subgraph problem

This page was built for publication: Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem

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