Author:
He Xin,Kao Ming-Yang,Lu Hsueh-I
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression, Prentice-Hall, Englewood Cliffs, NJ, 1990.
2. Lect Notes Comput Sci;R. C.-N. Chuang,1998
3. P. Elias, Universal codeword sets and representations of the integers, IEEE Transactions on Information Theory, IT-21 (1975), pp. 194–203.
4. H. Galperin and A. Wigderson, Succinct representations of graphs, Information and Control, 56 (1983), pp. 183–198.
5. X. He, M.-Y. Kao, and H.-I. Lu, Linear-time succinct encodings of planar graphs via canonical orderings, SIAM Journal on Discrete Mathematics, (1999). To appear.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Interactive Graph Summarization;Link Mining: Models, Algorithms, and Applications;2010