Advances in network complexity
From MaRDI portal
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05Cxx) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to biology (92-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)
Recommendations
Cited in
(13)- Degree-based entropies of networks revisited
- Graph operations based on using distance-based graph entropies
- On graph entropy measures based on the number of independent sets and matchings
- Entropy bounds for dendrimers
- Complexity, networks, and non-uniqueness
- Selection-based estimates of complexity unravel some mechanisms and selective pressures underlying the evolution of complexity in artificial networks
- Three Types of Network Complexity Pyramid
- The linear complexity of a graph
- The complexity of computations by networks
- Extremality of degree-based graph entropies
- Coexistence of stochastic oscillations and self-organized criticality in a neuronal network: sandpile model application
- Complexity in chemistry. Introduction and fundamentals.
- Complexity in chemistry, biology and ecology.
This page was built for publication: Advances in network complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840486)