- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2364-8228
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Comparative analysis of box-covering algorithms for fractal networks ; volume:6 ; number:1 ; day:30 ; month:9 ; year:2021 ; pages:1-37 ; date:12.2021
Applied network science ; 6, Heft 1 (30.9.2021), 1-37, 12.2021
- Creator
-
Kovács, Péter Tamás
Nagy, Marcell
Molontay, Roland
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s41109-021-00410-6
- URN
-
urn:nbn:de:101:1-2021121905415133058846
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:28 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kovács, Péter Tamás
- Nagy, Marcell
- Molontay, Roland
- SpringerLink (Online service)
Other Objects (12)
Optimal distributed covering algorithms
Minimal box size for fractal dimension estimation
Combinatorial Algorithms for Covering and Scheduling Problems
Algorithms for covering multiple submodular constraints and applications
ON CONVERGENCE OF BOX DIMENSIONS OF FRACTAL INTERPOLATION STOCHASTIC PROCESSES
Fractal
Exact and approximation algorithms for covering timeline in temporal graphs
Structural graph theory meets algorithms: covering and connectivity problems in graphs
Fractal Nanotechnology
Discrete tomography, packing and covering, and stable set problems : polytopes and algorithms
Adopting Relational Reinforcement Learning in Covering Algorithms for Numeric and Noisy Environments
Predictive modeling of CO2 capture efficiency using piperazine solutions: a comparative study of white-box algorithms
Optimal distributed covering algorithms
Minimal box size for fractal dimension estimation
Combinatorial Algorithms for Covering and Scheduling Problems
Algorithms for covering multiple submodular constraints and applications
ON CONVERGENCE OF BOX DIMENSIONS OF FRACTAL INTERPOLATION STOCHASTIC PROCESSES
Fractal
Exact and approximation algorithms for covering timeline in temporal graphs
Structural graph theory meets algorithms: covering and connectivity problems in graphs
Fractal Nanotechnology
Discrete tomography, packing and covering, and stable set problems : polytopes and algorithms
Adopting Relational Reinforcement Learning in Covering Algorithms for Numeric and Noisy Environments
Predictive modeling of CO2 capture efficiency using piperazine solutions: a comparative study of white-box algorithms
Optimal distributed covering algorithms
Minimal box size for fractal dimension estimation
Combinatorial Algorithms for Covering and Scheduling Problems
Algorithms for covering multiple submodular constraints and applications
ON CONVERGENCE OF BOX DIMENSIONS OF FRACTAL INTERPOLATION STOCHASTIC PROCESSES
Fractal
Exact and approximation algorithms for covering timeline in temporal graphs
Structural graph theory meets algorithms: covering and connectivity problems in graphs
Fractal Nanotechnology
Discrete tomography, packing and covering, and stable set problems : polytopes and algorithms
Adopting Relational Reinforcement Learning in Covering Algorithms for Numeric and Noisy Environments