Succinct Representations of Arbitrary Graphs
暂无分享,去创建一个
[1] György Turán,et al. On the succinct representation of graphs , 1984, Discret. Appl. Math..
[2] J. Ian Munro. Succinct Data Structures , 2004, Electron. Notes Theor. Comput. Sci..
[3] Xin He,et al. Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses , 1998, ICALP.
[4] Olivier Devillers,et al. Optimal succinct representations of planar maps , 2006, SCG '06.
[5] S. Srinivasa Rao,et al. Succinct indexes for strings, binary relations and multi-labeled trees , 2007, SODA '07.
[6] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.
[7] Alexander Golynski,et al. Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures , 2008 .
[8] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[9] Michael Hoffmann,et al. Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings , 2007, ESA.
[10] Moni Naor,et al. Implicit Representation of Graphs , 1992, SIAM J. Discret. Math..
[11] Jeffery R. Westbrook,et al. Short Encodings of Planar Graphs and Maps , 1995, Discret. Appl. Math..
[12] S. Srinivasa Rao,et al. Rank/select operations on large alphabets: a tool for text indexing , 2006, SODA '06.
[13] Guy E. Blelloch,et al. Compact representations of separable graphs , 2003, SODA '03.
[14] Rajeev Raman,et al. On the Size of Succinct Indices , 2007, ESA.
[15] Faith Ellen,et al. Optimal Bounds for the Predecessor Problem and Related Problems , 2002, J. Comput. Syst. Sci..
[16] S. Srinivasa Rao,et al. Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents , 2006, CPM.
[17] Venkatesh Raman,et al. Succinct representation of balanced parentheses, static trees and planar graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[18] Torben Hagerup,et al. Efficient Minimal Perfect Hashing in Nearly Minimal Space , 2001, STACS.