@inproceedings{b36f83cc0cd146628271820ff2a87257,
title = "Compact encodings of planar graphs via canonical orderings and multiple parentheses",
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.",
author = "Chuang, {Richie Chih Nan} and Ashim Garg and Xin He and Kao, {Ming Yang} and Lu, {Hsueh I.}",
year = "1998",
doi = "10.1007/bfb0055046",
language = "English (US)",
isbn = "3540647813",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "118--129",
booktitle = "Automata, Languages and Programming - 25th International Colloquium, ICALP 1998, Proceedings",
note = "25th International Colloquium on Automata, Languages and Programming, ICALP 1998 ; Conference date: 13-07-1998 Through 17-07-1998",
}