On measuring the complexity of networks: Kolmogorov complexity versus entropy

From MaRDI portal
Publication:1687410

DOI10.1155/2017/3250301zbMath1378.90034OpenAlexW2765310599WikidataQ60692609 ScholiaQ60692609MaRDI QIDQ1687410

Przemysław Kazienko, Tomasz Kajdanowicz, Mikołaj Morzy

Publication date: 3 January 2018

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/3250301




Related Items (5)


Uses Software



Cites Work




This page was built for publication: On measuring the complexity of networks: Kolmogorov complexity versus entropy