Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Survey of Fractal Dimensions of NetworksNetwork Box Counting Heuristics

A Survey of Fractal Dimensions of Networks: Network Box Counting Heuristics [In this chapter we examine several methods for computing a minimal set of diameter-based boxes, or a minimal set of radius-based boxes, to cover 𝔾\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb {G}$$ \end{document}.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Survey of Fractal Dimensions of NetworksNetwork Box Counting Heuristics

Download PDF
14 pages

Loading next page...
 
/lp/springer-journals/a-survey-of-fractal-dimensions-of-networks-network-box-counting-2AoMTmDMcb
Publisher
Springer International Publishing
Copyright
© The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature 2018
ISBN
978-3-319-90046-9
Pages
13 –27
DOI
10.1007/978-3-319-90047-6_3
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter we examine several methods for computing a minimal set of diameter-based boxes, or a minimal set of radius-based boxes, to cover 𝔾\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb {G}$$ \end{document}.]

Published: May 30, 2018

Keywords: Uncovered Nodes; Greedy Coloring; Central Node; Scale-free Networks; Modern Network Science

There are no references for this article.