arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0101021cs.DScs.GR
收藏

图的信息论最优编码的快速通用方法

A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

Xin He, Ming-Yang Kao, Hsueh-I Lu

摘要:

我们提出了一种快速的方法来编码图的信息理论上最小的比特数。具体地说,具有性质pi的图被称为pi-图。如果pi满足某些性质,则n-节点m-边pi-图G可以用二进制串X编码,使得(1)G和X可以在O(nlog n)时间内从彼此获得,并且(2)对于任何连续的超可加函数beta(n),X最多有beta(n)+o(beta(n))位,使得最多有2^{beta(n)+o(beta(n))}个不同的n-节点pi-图。该方法是适用于一般类的图形,本文侧重于平面图。这样的pi的示例包括以下性质组上的所有合取:(1)G是平面图或平面图;(2)G是有向的或无向的;(3)G是三角形的、三连通的、双连通的、仅连通的或不需要连通的;(4)G的节点用来自{1,.,ell_1},其中ell_1 <= n;(5)G的边用来自{1,.,(6)G的每个结点(边)至多有ell_3 = O(1)个自环(分别为ell_4 = O(1)个重边).此外,对于pi是平面三角剖分的情况,ell_3和ell_4不需要是O(1)。这些例子是平面图的小循环分离器的新应用,是唯一的非平凡类的图形,而不是根树,与已知的多项式时间信息理论上的最佳编码方案。

英文摘要:

We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property pi is called a pi-graph. If pi satisfies certain properties, then an n-node m-edge pi-graph G can be encoded by a binary string X such that (1) G and X can be obtained from each other in O(n log n) time, and (2) X has at most beta(n)+o(beta(n)) bits for any continuous super-additive function beta(n) so that there are at most 2^{beta(n)+o(beta(n))} distinct n-node pi-graphs. The methodology is applicable to general classes of graphs; this paper focuses on planar graphs. Examples of such pi include all conjunctions over the following groups of properties: (1) G is a planar graph or a plane graph; (2) G is directed or undirected; (3) G is triangulated, triconnected, biconnected, merely connected, or not required to be connected; (4) the nodes of G are labeled with labels from {1, ..., ell_1} for ell_1 <= n; (5) the edges of G are labeled with labels from {1, ..., ell_2} for ell_2 <= m; and (6) each node (respectively, edge) of G has at most ell_3 = O(1) self-loops (respectively, ell_4 = O(1) multiple edges). Moreover, ell_3 and ell_4 are not required to be O(1) for the cases of pi being a plane triangulation. These examples are novel applications of small cycle separators of planar graphs and are the only nontrivial classes of graphs, other than rooted trees, with known polynomial-time information-theoretically optimal coding schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑