- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2364-8228
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Kovács, Péter Tamás
Nagy, Marcell
Molontay, Roland
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s41109-021-00410-6
- URN
-
urn:nbn:de:101:1-2021121905415133058846
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:28 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kovács, Péter Tamás
- Nagy, Marcell
- Molontay, Roland
- SpringerLink (Online service)
Ähnliche Objekte (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