Entropy and the complexity of graphs revisited
From MaRDI portal
Publication:406027
DOI10.3390/E14030559zbMATH Open1331.94041OpenAlexW2059033281MaRDI QIDQ406027FDOQ406027
Authors: Abbe Mowshowitz, Matthias Dehmer
Publication date: 8 September 2014
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e14030559
Recommendations
Information theory (general) (94A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Statistical mechanics of complex networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- Information theoretic measures of UHG graphs with low computational complexity
- 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
- Title not available (Why is that?)
- On some counting polynomials in chemistry
- An axiomatic approach to network complexity
- Complexity in chemistry, biology and ecology.
- Quantitative methods for ecological network analysis
- Graph complexity and the laplacian matrix in blocked experiments
- Title not available (Why is that?)
Cited In (40)
- Fractal networks: topology, dimension, and complexity
- Entropy of theK-Satisfiability Problem
- Title not available (Why is that?)
- Entropy modeling of network structures
- Laplacian spectra for categorical product networks and its applications
- The evaluation of the number and the entropy of spanning trees on generalized small-world networks
- Graph properties, graph limits, and entropy
- Title not available (Why is that?)
- A history of graph entropy measures
- Title not available (Why is that?)
- Perfection, imperfection, and graph entropy
- Graphs that Split Entropies
- Title not available (Why is that?)
- Characterizing complex networks through statistics of Möbius transformations
- Information processing in complex networks: Graph entropy and information functionals
- The structure entropy of social networks
- Allometric scaling of von Neumann entropy in animal connectomes and its evolutionary aspect
- Depth-based complexity traces of graphs
- Towards a mathematics of complexity
- Title not available (Why is that?)
- Information theoretic measures of UHG graphs with low computational complexity
- Graph Operations Decreasing Values of Degree-Based Graph Entropies
- Consistency matters: revisiting the structural complexity for supply chain networks
- Recovering Set Systems and Graph Entropy
- On sequential structures in incompressible multidimensional networks
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- GeoEntropy: a measure of complexity and similarity
- Network entropies based on independent sets and matchings
- Title not available (Why is that?)
- Advances in network complexity
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- Covalent organic frameworks: topological characterizations, spectral patterns and graph entropies
- On entropy measures of some titania and carbon nanotubes
- Typology by means of language networks: applying information theoretic measures to morphological derivation networks
- Entropy of Digraphs and Infinite Networks
- Fixation probabilities for simple digraphs
- Title not available (Why is that?)
- An axiomatic approach to network complexity
- On the possible values of the entropy of undirected graphs
- Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
This page was built for publication: Entropy and the complexity of graphs revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406027)