Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Entropy of Digraphs and Infinite Networks

From MaRDI portal
Publication:4900003
Jump to:navigation, search

DOI10.1007/978-0-8176-4904-3_1zbMath1256.68132OpenAlexW949527147MaRDI QIDQ4900003

Abbe Mowshowitz

Publication date: 11 January 2013

Published in: Towards an Information Theory of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-8176-4904-3_1


zbMATH Keywords

entropynetworksdigraphsinfinite graphsinformation content


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)








This page was built for publication: Entropy of Digraphs and Infinite Networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4900003&oldid=19286608"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 05:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki