TY - GEN

T1 - A fast general methodology for information — theoretically optimal encodings of graphs

AU - He, Xin

AU - Kao, Ming Yang

AU - Lu, Hsueh I.

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. The methodology is applicable to general classes of graphs; this paper focuses on simple planar graphs. Specifically, a graph with property π is called a π-graph.If π satisfies certain properties, then an n-node π-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 β(n)+o(β(n)) bits for any function β(n) = Ω{n) so that there are at most 2β(n)+o(β (n)) distinct n-node n-graphs. Examples of such n include all conjunctions of the following sets 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; and (4) G has at most ℓ1 (respectively, ℓ2) distinct node (respectively, edge) labels. These examples are novel applications of small cycle separators of planar graphs and settle several problems that have been open since Tutte's census series were published in 1960's.

AB - We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. The methodology is applicable to general classes of graphs; this paper focuses on simple planar graphs. Specifically, a graph with property π is called a π-graph.If π satisfies certain properties, then an n-node π-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 β(n)+o(β(n)) bits for any function β(n) = Ω{n) so that there are at most 2β(n)+o(β (n)) distinct n-node n-graphs. Examples of such n include all conjunctions of the following sets 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; and (4) G has at most ℓ1 (respectively, ℓ2) distinct node (respectively, edge) labels. These examples are novel applications of small cycle separators of planar graphs and settle several problems that have been open since Tutte's census series were published in 1960's.

UR - http://www.scopus.com/inward/record.url?scp=84958059248&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958059248&partnerID=8YFLogxK

U2 - 10.1007/3-540-48481-7_47

DO - 10.1007/3-540-48481-7_47

M3 - Conference contribution

AN - SCOPUS:84958059248

SN - 3540662510

SN - 9783540662518

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 540

EP - 549

BT - Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings

A2 - Nešetřil, Jaroslav

PB - Springer Verlag

T2 - 7th Annual European Symposium on Algorithms, ESA 1999

Y2 - 16 July 1999 through 18 July 1999

ER -