Name
Abstract | ||
|---|---|---|
The fractal is an important feature of many real complex networks. According to the definition of the Hausdorff dimension, the minimum number of boxes that can be used to cover complex networks is an important factor for revealing the fractal feature of self-similar complex networks. The calculation of the minimum number of boxes is an NP (Non-deterministic Polynomial)-hard problem. In this paper, a heuristic algorithm, named the Max-Min ant colony algorithm, is introduced to approximate the minimum number of boxes. The pheromone-updating rules and heuristic rules are redefined to improve the performance of the algorithm. The experimental results show that, for Escherichia coli networks, the number of boxes was significantly decreased compared to the box-covering greedy algorithm, especially when the box size is small. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1080/00207160.2017.1364370 | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS |
Keywords | Field | DocType |
Fractal feature, self-similar complex networks, Max-Min ant colony algorithm, heuristic rules, box-covering | Ant colony optimization algorithms,Hausdorff dimension,Mathematical optimization,Heuristic,Fractal dimension,Heuristic (computer science),Fractal,Greedy algorithm,Complex network,Mathematics | Journal |
Volume | Issue | ISSN |
95 | 10 | 0020-7160 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dongyan Li | 1 | 1 | 0.69 |
| Xingyuan Wang | 2 | 134 | 14.40 |
| Penghe Huang | 3 | 0 | 0.34 |