Abstract
We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case.
Cite
CITATION STYLE
Chuang, R. C. N., Garg, A., He, X., Kao, M. Y., & Lu, H. I. (1998). Compact encodings of planar graphs via canonical orderings and multiple parentheses. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 118–129). Springer Verlag. https://doi.org/10.1007/bfb0055046
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
