Succinct representation of labeled graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 316-328

  Barbay, Jérémy ^a   Aleardi, Luca Castelli ^b,c   He, Meng ^a,d   Munro, J Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b ÉCOLE POLYTECHNIQUE   (France)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COST REDUCTION; EDGE DETECTION; MATHEMATICAL MODELS; TRIANGULATION;

LABELED GRAPHS; SUCCINCT REPRESENTATION;

GRAPH THEORY;

EID: 38149096902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_29     Document Type: Conference Paper

References (18)

1. Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 24-35. Springer, Heidelberg (2006)
2. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 680-689. ACM Press, New York (2007)
3. Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275-292 (2005)
4. Bernhart, F., Kainen, P.C.: The book thickness of a graph. Journal of Combinatorial Theory, Series B 27(3), 320-331 (1979)
5. Castelli-Aleardi, L., De villers, O., Schaeffer, G.: Succinct representation of triangulations with a boundary. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 134-145. Springer, Heidelberg (2005)
6. Castelli-Aleardi, L., Devillers, O., Schaeffer, G.: Optimal succinct representations of planar maps. In: Proceedings of the 22nd ACM Annual Symposium on Computational Geometry, pp. 309-318 (2006)
7. Chiang, Y.-T., Lin, C.-C., Lu, H.-L: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proceedings of the 12th Annual ACM-SIAM symposium on Discrete algorithms, pp. 506-515 (2001)
8. Chuang, R.C.-N., Garg, A., He, X., Kao, M.-Y., Lu, H.-I.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming, pp. 118-129 (1998)
9. Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebr. Discrete Methods 8(1), 33-58 (1987)
10. Gavoille, C., Hanusse, N.: On compact encoding of pagenumber k graphs. Discrete Mathematics & Theoretical Computer Science (to appear, 2007)
11. Isenburg, M., Snoeyink, J.: Face fixer: Compressing polygon meshes with properties. In: Proceedings of SIGGRAPH 2000, pp. 263-270 (2000)
12. Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 549-554 (1989)
13. Lu, H.-I., Yeh, C.-C.: Balanced parentheses strike back. ACM Transactions on Algorithms (accepted, 2007)
14. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762-776 (2001)
15. Rosenberg, A.L.: The diogenes design methodology: toward automatic physical layout. In: Proceedings of the International Workshop on Parallel Algorithms & Architectures, pp. 335-348. North-Holland Publishing Co., Amsterdam (1986)
16. Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138-148 (1990)
17. Tarjan, R.E.: Sorting using networks of queues and stacks. J. Assoc. Comput. Mach. 19, 341-346 (1972)
18. Yannakakis, M.: Four pages are necessary and sufficient for planar graphs. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Theory of Computing, pp. 104-108 (1986)