A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
DOI10.1137/S0097539799359117zbMath0965.05090MaRDI QIDQ4507374
Hsueh-I Lu, Xin He, Ming-Yang Kao
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
data compressionplanar graphstriangulationsgraph encodingbiconnected graphstriconnected graphscycle separators
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Information theory (general) (94A15)
Related Items (12)
This page was built for publication: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs