| Autor: |
Péter Tamás Kovács, Marcell Nagy, Roland Molontay |
| Jazyk: |
angličtina |
| Rok vydání: |
2021 |
| Předmět: |
|
| Zdroj: |
Applied Network Science, Vol 6, Iss 1, Pp 1-37 (2021) |
| Druh dokumentu: |
article |
| ISSN: |
2364-8228 |
| DOI: |
10.1007/s41109-021-00410-6 |
| Popis: |
Abstract Research on fractal networks is a dynamically growing field of network science. A central issue is to analyze the fractality with the so-called box-covering method. As this problem is known to be NP-hard, a plethora of approximating algorithms have been proposed throughout the years. This study aims to establish a unified framework for comparing approximating box-covering algorithms by collecting, implementing, and evaluating these methods in various aspects including running time and approximation ability. This work might also serve as a reference for both researchers and practitioners, allowing fast selection from a rich collection of box-covering algorithms with a publicly available codebase. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
Full text from SpringerLink