A max-min ant colony algorithm for fractal dimension of complex networks

DOI10.1080/00207160.2017.1364370MaRDI QIDQ5028613zbMATH OpenOpenAlexFDO

Authors Dongyan Li, Penghe Huang, Xingyuan Wang

Publication date 10 February 2022

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2017.1364370

zbMATH Keywords

heuristic rulesmax-min ant colony algorithmbox-coveringfractal featureself-similar complex networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80)

Recommendations

• A new information dimension of complex networks
• Fractal Dimensions of Networks
• A survey of fractal dimensions of networks
• Generalized Hausdorff dimensions of a complex network
• Minimal partition coverings and generalized dimensions of a complex network

Cites work

• scientific article; zbMATH DE number 192842 (Why is no real title available?)
• scientific article; zbMATH DE number 2060078 (Why is no real title available?)
• An ACO algorithm for the graph coloring problem
• Collective dynamics of `small-world' networks
• On the fractal geometry of DNA by the binary image analysis

Cited in

(2)

• Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
• THE POWER FUNCTION HIDDEN IN THE VULNERABILITY OF FRACTAL COMPLEX NETWORKS

Describes a project that uses

Uses Software

• Pajek datasets
• Pajek

This page was built for publication: A max-min ant colony algorithm for fractal dimension of complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028613)