Entropy, Volume 23, Issue 12
2021 December - 151 articles
Cover Story: Historically, quantifying the complexity of graphs and networks has been of great interest to scientists in different fields. In this paper, we have tackled this problem using Kolmogorov complexity as the metric. Firstly, ‘Kolmogorov basic graphs’ are defined as those with the least possible Kolmogorov complexity. These graphs are then seen as the building blocks for constructing any given graph. Consequently, the complexity of a graph is estimated by decomposing it into a set of Kolmogorov basic graphs. The result is an algorithm, called ‘Kolmogorov graph covering’, which takes a graph as an input and returns an upper bound for its Kolmogorov complexity. View this paper. - Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
- You may sign up for email alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.