Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
From MaRDI portal
Publication:6081679
DOI10.18255/1818-1015-2023-2-128-139MaRDI QIDQ6081679
Vladimir Vasilevich Vasilchikov
Publication date: 5 October 2023
Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/mais794
Cites Work
- Backtrack search algorithms and the maximal common subgraph problem
- Parallel Algorithm for Solving the Graph Isomorphism Problem
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- Algorithm 457: finding all cliques of an undirected graph
- Unnamed Item
This page was built for publication: Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem