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

DOI10.1080/00207160.2017.1364370zbMATH Open1499.05588OpenAlexW2747976659MaRDI QIDQ5028613FDOQ5028613

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

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

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)

Cites Work

• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• On the fractal geometry of DNA by the binary image analysis
• Title not available (Why is that?)
• An ACO algorithm for the graph coloring problem

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

Uses Software

• Pajek
• Pajek datasets

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)