CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES (Q3393530): Difference between revisions

@@ Property / cites work @@
+Recursive density types and Nerode extensions of arithmetic
+Normal rank
@@ Property / cites work @@
+Q5432687
@@ Property / cites work: Q5432687 / rank @@
+Normal rank
@@ Property / cites work @@
+Mining Graph Data
@@ Property / cites work: Mining Graph Data / rank @@
+Normal rank
@@ Property / cites work @@
+A comparative analysis of multidimensional features of objects resembling sets of graphs
+Normal rank
@@ Property / cites work @@
+Topological mappings between graphs, trees and generalized trees
+Normal rank
@@ Property / cites work @@
+Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
+Normal rank
@@ Property / cites work @@
+Entropy and the complexity of graphs: III. Graphs with prescribed information content
+Normal rank
@@ Property / cites work @@
+Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
+Normal rank
@@ Property / cites work @@
+Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
+Normal rank