Author:
Farzan Arash,Munro J. Ian
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Munro, J.I.: Succinct data structures. Electronic Notes in Theoretical Computer Science 91, 3 (2004)
2. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5(4), 596–603 (1992)
3. Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact representations of separable graphs. In: SODA, pp. 679–688 (2003)
4. Turán, G.: On the succinct representation of graphs. Discrete Applied Mathematics 8, 289–294 (1984)
5. Keeler, Westbrook: Short encodings of planar graphs and maps. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 58 (1995)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Searching for Minimal Integer Representation of Undirected Graphs;Communications in Computer and Information Science;2023-11-26
2. Slim graph;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2019-11-17
3. On Graph Representation with Smallest Numerical Encoding;2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC);2018-07
4. On the Numerical Representation of Labeled Graphs with Self-Loops;2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI);2017-11
5. On the Succinct Representation of Equivalence Classes;Algorithmica;2016-07-27