CHARACTERIZING CLASSES OF STRUCTURED OBJECTS BY MEANS OF INFORMATION INEQUALITIES
From MaRDI portal
Publication:3393530
DOI10.1080/01969720902728369zbMath1192.68165MaRDI QIDQ3393530
Matthias Dehmer, Stephan Borgert
Publication date: 26 August 2009
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969720902728369
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
68P01: General topics in the theory of data
Cites Work
- Topological mappings between graphs, trees and generalized trees
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- Mining Graph Data
- Recursive density types and Nerode extensions of arithmetic
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Unnamed Item