Journal
APPLIED ARTIFICIAL INTELLIGENCE
Volume 22, Issue 7-8, Pages 684-706Publisher
TAYLOR & FRANCIS INC
DOI: 10.1080/08839510802164101
Keywords
-
Ask authors/readers for more resources
In this article, we present information-theoretic concepts for analyzing complex networks. We see that the application of information-theoretic concepts to networks leads to interesting tasks and gives a possibility for understanding information processing in networks. The main contribution of this article is a method for determining the structural information content of graphs that is based on a tree decomposition. It turns out that the computational complexity of the underlying algorithm is polynomial. Finally, we present some numerical results to study the influence of the used methods on the resulting information contents.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available