On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs
From MaRDI portal
Publication:6346874
arXiv2008.04744MaRDI QIDQ6346874
Author name not available (Why is that?)
Publication date: 4 August 2020
Abstract: This report concerns the information content of a graph, optionally conditional on one or more background, "common knowledge" graphs. It describes an algorithm to estimate this information content, and includes some examples based on chemical compounds.
No records found.
This page was built for publication: On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6346874)
