论文标题
关于图形（网络）通过信息内容以及有条件的（共同）信息的复杂性给定其他图
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.
