An Algorithm for Mining Frequent Approximate Subgraphs with Structural and Label Variations in Graph Collections
Using graphs as a data structure is a simple way to represent relationships between objects. Consequently, it has raised the need for algorithms to process, analyze, and extract meaningful information from graphs. Therefore, frequent subgraph mining (FSM) algorithms have been reported in the literat...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2025-07-01
|
| coleção: | Applied Sciences |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/2076-3417/15/14/7880 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|