LineCP-time compression of bounded-genus graphs into information- theoretically optimal number of bits

HSUEH-I LU2020-05-042020-05-042014https://scholars.lib.ntu.edu.tw/handle/123456789/488597LineCP-time compression of bounded-genus graphs into information- theoretically optimal number of bitsconference paper10.1137/120879142https://www.scopus.com/inward/record.uri?eid=2-s2.0-84899649083&doi=10.1137%2f120879142&partnerID=40&md5=e122670f455b916e67081566267fb089