Add to ORKGAbstract—Many real-world systems such as the WWW, Semantic Web, logical expressions, and social networks can be represented in graphical forms. This paper studies compressing graphical structures from a graph entropy point of view. We show that structural entropy is equal to the chromatic entropy of the characteristic graph, termed the structural characteristic graph. We establish the relation between structural entropy and graph entropy, and investigate the cases when (conditional) graph entropy is equal to (conditional) chromatic entropy. I
Consider the setting of sparse graphs on N vertices, where the vertices have distinct “names”, which...
Abstract—In this paper, we consider the problem of finding the minimum entropy coloring of a charact...
A topological index is a number that is connected to a chemical composition in order to correlate a ...
For various purposes and, in particular, in the context of data compression, a graph can be examined...
Based on the algorithmic proof of Lovász local lemma due to Moser and Tardos, Esperet and Parreau de...
http://deepblue.lib.umich.edu/bitstream/2027.42/6710/5/bad0194.0001.001.pdfhttp://deepblue.lib.umich...
Graphs resulting from human behavior (the web graph, friendship graphs, etc.) have hitherto been vie...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
The degree-based network entropy which is inspired by Shannon’s entropy concept becomes the informat...
Measuring protein structural similarity attempts to establish a relationship of equivalence between ...
With the rapid expansion of graphs and networks and the growing magnitude of data from all areas of ...
Abstract. We present an algorithmic approach to solving the problem of chromatic entropy, a combinat...
Entropy is an important indicator to measure network heterogeneity. We propose a new network structu...
In this article, we discuss the problem of establishing relations between information measures for n...
In this article, we discuss the problem of establishing relations between information measures for n...
Consider the setting of sparse graphs on N vertices, where the vertices have distinct “names”, which...
Abstract—In this paper, we consider the problem of finding the minimum entropy coloring of a charact...
A topological index is a number that is connected to a chemical composition in order to correlate a ...
For various purposes and, in particular, in the context of data compression, a graph can be examined...
Based on the algorithmic proof of Lovász local lemma due to Moser and Tardos, Esperet and Parreau de...
http://deepblue.lib.umich.edu/bitstream/2027.42/6710/5/bad0194.0001.001.pdfhttp://deepblue.lib.umich...
Graphs resulting from human behavior (the web graph, friendship graphs, etc.) have hitherto been vie...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
The degree-based network entropy which is inspired by Shannon’s entropy concept becomes the informat...
Measuring protein structural similarity attempts to establish a relationship of equivalence between ...
With the rapid expansion of graphs and networks and the growing magnitude of data from all areas of ...
Abstract. We present an algorithmic approach to solving the problem of chromatic entropy, a combinat...
Entropy is an important indicator to measure network heterogeneity. We propose a new network structu...
In this article, we discuss the problem of establishing relations between information measures for n...
In this article, we discuss the problem of establishing relations between information measures for n...
Consider the setting of sparse graphs on N vertices, where the vertices have distinct “names”, which...
Abstract—In this paper, we consider the problem of finding the minimum entropy coloring of a charact...
A topological index is a number that is connected to a chemical composition in order to correlate a ...