Publisher
Springer Nature Singapore
Reference31 articles.
1. Aleardi, L.C., Devillers, O., Schaeffer, G.: Optimal succinct representations of planar maps. In: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, pp. 309–318 (2006)
2. Barbay, J., Castelli Aleardi, L., He, M., Munro, J.I.: Succinct representation of labeled graphs. Algorithmica 62, 224–257 (2012)
3. Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact representations of separable graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 679–688. SODA 2003, Society for Industrial and Applied Mathematics, USA (2003)
4. Lecture Notes in Computer Science;GE Blelloch,2010
5. Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 587–596 (2011)