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

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.