https://libeldoc.bsuir.by/handle/123456789/54403| Title: | Improving efficiency of VF3 and VF3-light algorithms for sparse graphs |
| Authors: | Dzenhaliou, D. I. Sarvanov, V. I. |
| Keywords: | материалы конференций;graph;algorithm;isomorphism |
| Issue Date: | 2023 |
| Publisher: | BSU |
| Citation: | Dzenhaliou, D. I. Improving efficiency of VF3 and VF3-light algorithms for sparse graphs / D. I. Dzenhaliou, V. I. Sarvanov // Pattern Recognition and Information Processing (PRIP'2023) = Распознавание образов и обработка информации (2023) : Proceedings of the 16th International Conference, October 17–19, 2023, Minsk, Belarus / United Institute of Informatics Problems of the National Academy of Sciences of Belarus. – Minsk, 2023. – P. 300–304. |
| Abstract: | Researchers have made notable progress in improv- ing the way we fi nd isomorphic subgraphs in labeled or unlabeled graphs by focusing on effi ciency. One group of algorithms, known as the VF series, has consistently shown its effectiveness, especially when dealing with large sparse graphs. In this paper, we introduce a new method that leverages machine learning capabilities, aiming to improve the performance of VF3 and VF3- light algorithms in solving the specifi ed problem. Also, we propose a new parallelization scheme for VF3 and VF3-light algorithms. |
| URI: | https://libeldoc.bsuir.by/handle/123456789/54403 |
| Appears in Collections: | Pattern Recognition and Information Processing (PRIP'2023) = Распознавание образов и обработка информации (2023) |
| File | Description | Size | Format | |
|---|---|---|---|---|
| Dzenhaliou_Improving.pdf | 180.82 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.