Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
The paper proposes an algorithm for solving the problem of finding the maximum common subgraph. Both the sequential and the parallel version of the algorithm, their software implementation are described, and an experimental study of their effectiveness is carried out. This problem is one of the mos...
Saved in:
Main Author: | Vladimir V. Vasilchikov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2023-06-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/1775 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
by: Vladimir V. Vasilchikov
Published: (2022-03-01) -
Parallel Algorithm for Solving the Graph Isomorphism Problem
by: Vladimir Vasilyevich Vasilchikov
Published: (2020-03-01) -
On а Recursive-Parallel Algorithm for Solving the Knapsack Problem
by: Vladimir V. Vasilchikov
Published: (2018-04-01) -
Corrigendum to: V. V. Vasilchikov, “Parallel Algorithm for Solving the Graph Isomorphism Problem”, Modeling and analysis of information systems, vol. 27, no. 1, pp. 86–94, 2020. DOI: https://doi.org/10.18255/1818-1015-2020-1-86-94
by: Vladimir Vasilyevich Vasilchikov
Published: (2021-10-01) -
On the Recursive-Parallel Programming for the .NET Framework
by: V. V. Vasilchikov
Published: (2014-04-01)