On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs (Q6346874)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs |
preprint article from arXiv |
Statements
4 August 2020
0 references
cs.IT
0 references
math.IT
0 references
Lloyd Allison
0 references