Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017, Article ID 3250301, 12 pages
https://doi.org/10.1155/2017/3250301
Research Article

On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy

1Institute of Computing Science, Poznan University of Technology, Piotrowo 2, 60-965 Poznań, Poland
2Department of Computational Intelligence, ENGINE-The European Centre for Data Science, Wrocław University of Science and Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland

Correspondence should be addressed to Mikołaj Morzy; lp.nanzop.tup@yzrom.jalokim

Received 6 April 2017; Revised 27 July 2017; Accepted 13 August 2017; Published 1 November 2017

Academic Editor: Pasquale De Meo

Copyright © 2017 Mikołaj Morzy et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

Mikołaj Morzy, Tomasz Kajdanowicz, and Przemysław Kazienko, “On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy,” Complexity, vol. 2017, Article ID 3250301, 12 pages, 2017. https://doi.org/10.1155/2017/3250301.