Searching for Similar Subgraphs in an Unweighted Undirected Graph by Computing Isomorphic Path Sets
The topic of subgraph search in a supergraph remains relevant and fundamental. Graphs are highly successful models for both visualization and handling complex relationships, such as those represented in semantic networks or even source code of programs. One of the most important tasks in analyzing s...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The Fund for Promotion of Internet media, IT education, human development «League Internet Media»
2024-03-01
|
| Series: | Современные информационные технологии и IT-образование |
| Subjects: | |
| Online Access: | https://sitito.cs.msu.ru/index.php/SITITO/article/view/1063 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|