On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs

08/04/2020
by   Lloyd Allison, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset