Author:
Munro J. Ian,Nicholson Patrick K.
Reference20 articles.
1. Barbay J, Castelli Aleardi L, He M, Munro JI (2012) Succinct representation of labeled graphs. Algorithmica 62(1–2):224–257
2. Blandford DK, Blelloch GE, Kash IA (2003) Compact representations of separable graphs. In: SODA, ACM/SIAM, pp 679–688
3. Lecture notes in computer science, vol;GE Blelloch,2010
4. Brightwell G, Goodall S (1996) The number of partial orders of fixed width. Order 13(4):315–337. doi:10.1007/BF00405592, http://dx.doi.org/10.1007/BF00405592
5. Lecture notes in computer science, vol;L Castelli Aleardi,2005
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs;Combinatorial Optimization and Applications;2021
2. Fast and Compact Planar Embeddings;Lecture Notes in Computer Science;2017
3. Succinct Data Structures ... Potential for Symbolic Computation?;Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation;2016-07-20