Skip to main content
English
中文
Log In
Log in
Log in with ORCID
NTU Single Sign On
Have you forgotten your password?
Home
College of Electrical Engineering and Computer Science / 電機資訊學院
Computer Science and Information Engineering / 資訊工程學系
LineCP-time compression of bounded-genus graphs into information- theoretically optimal number of bits
Details
LineCP-time compression of bounded-genus graphs into information- theoretically optimal number of bits
Journal
SIAM Journal on Computing
Journal Volume
43
Journal Issue
2
Pages
477-496
Date Issued
2014
Author(s)
HSUEH-I LU
DOI
10.1137/120879142
URI
https://scholars.lib.ntu.edu.tw/handle/123456789/488597
URL
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84899649083&doi=10.1137%2f120879142&partnerID=40&md5=e122670f455b916e67081566267fb089
Type
conference paper