Orderly spanning trees with applications to graph encoding and graph drawing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 506-515

  Chiang, Yi Ting ^a   Lin, Ching Chi ^a   Lu, Hsueh I ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Algorithms; Design; Theory; Verification

Indexed keywords

EID: 0038776172     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Timothy C. Bell , John G. Cleary , Ian H. Witten, Text compression, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
2. Andrej Brodnik , J. Ian Munro, Membership in Constant Time and Almost-Minimum Space, SIAM Journal on Computing, v.28 n.5, p.1627-1640, April/May 1999 [doi〉10.1137/S0097539795294165]
3. Richie Chih-Nan Chuang , Ashim Garg , Xin He , Ming-Yang Kao , Hsueh-I Lu, Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses, Proceedings of the 25th International Colloquium on Automata, Languages and Programming, p.118-129, July 13-17, 1998
4. David Richard Clark, Compact pat trees, University of Waterloo, Waterloo, Ont., Canada, 1998
5. Robert F. Cohen , Giuseppe Di Battista , Arkady Kanevsky , Roberto Tamassia, Reinventing the wheel: an optimal data structure for connectivity queries, Proceedings of the twentyfifth annual ACM symposium on Theory of computing, p.194-200, May 16-18, 1993, San Diego, California, United States [doi〉10.1145/167088.167152]
6. H. De Fraysseix, J. Pazh, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
7. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21:194-203, 1975.
8. Ulrich Fößmeier , Goos Kant , Michael Kaufmann, 2-Visibility Drawings of Planar Graphs, Proceedings of the Symposium on Graph Drawing, p.155-168, September 18-20, 1996
9. Michael L. Fredman , Dan E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, Journal of Computer and System Sciences, v.48 n.3, p.533-551, June 1994 [doi〉10.1016/S0022-0000(05)80064- 9]
10. D. Harel and M. Sardas. An algorithm for straight-line drawing of planar graphs. Algorithmica, 20(2):119- 135, 1998.
11. Xin He , Ming-Yang Kao , Hsueh-I Lu, Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings, SIAM Journal on Discrete Mathematics, v.12 n.3, p.317-325, Sept. 1999 [doi〉10.1137/S0895480197325031]
12. Xin He , Ming-Yang Kao , Hsueh-I Lu, A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs, SIAM Journal on Computing, v.30 n.3, p.838-846, 2000 [doi〉10.1137/S0097539799359117]
13. IEEE. 38th Annual Symposium on Foundations of Computer Science, Miami Beach, Florida, 20-22 Oct. 1997.
14. A. Itai and M. Rodeh. Representation of graphs. Acta Informatica, 17:215-219, 1982.
15. G. Jacobson. Spwce-efficient static trees and graphs. In 30th Annual Symposium on Foundations off Computer Science, pages 549-554, Research Triangle Park, North Carolina, 30 Oct.-1 Nov. 1989. IEEE.
16. Sampath Kannan , Moni Naor , Steven Rudich, Implicit representation of graphs, SIAM Journal on Discrete Mathematics, v.5 n.4, p.596-603, Nov. 1992 [doi〉10.1137/0405049]
17. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16(1):4-32, 1996.
18. Goos Kant , Xin He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, v.172 n.1-2, p.175-193, Feb. 10, 1997 [doi〉10.1016/S0304-3975(95)00257-X]
19. Kenneth Keeler , Jeffery Westbrook, Short encodings of planar graphs and maps, Discrete Applied Mathematics, v.58 n.3, p.239-252, April 7, 1995 [doi〉10.1016/0166-218X(93) E0150-W]
20. J. I. Munro , V. Raman, Succinct representation of balanced parentheses, static trees and planar graphs, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.118, October 19-22, 1997
21. M. Naor, Succinct representation of general unlabeled graphs, Discrete Applied Mathematics, v.28 n.3, p.303-307, Sep. 1990 [doi〉10.1016/0166- 218X(90)90011-Z]
22. Jarek Rossignac, Edgebreaker: Connectivity Compression for Triangle Meshes, IEEE Transactions on Visualization and Computer Graphics, v.5 n.1, p.47-61, January 1999 [doi〉10.1109/2945.764870]
23. Walter Schnyder, Embedding planar graphs on the grid, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.138-148, January 22-24, 1990, San Francisco, California, United States
24. Maurizio Talamo , Paola Vocca, Compact Implicit Representation of Graphs, Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, p.164-176, June 18-20, 1998
25. M. Thorup, Undirected single source shortest paths in linear time, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.12, October 19-22, 1997
26. Mikkel Thorup, On RAM Priority Queues, SIAM Journal on Computing, v.30 n.1, p.86-109, 2000 [doi〉10.1137/S0097539795288246]
27. G. Turan. On the succinct representation of graphs. Discrete Applied Mathematics, 8:289-294, 1984.
28. W. T. Tutte. A census of planar triangulations. Canadian Journal of Mathematics, 14:21-38, 1962.
29. W. T. Tutte. A census of planar maps. Canadian Journal of Mathematics, 15:249-271, 1963.
30. P. van Erode Boas. Machine models and simulations. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 1, pages 1-60. Elsevier, Amsterdam, 1990.
31. Mihalis Yannakais, Embedding planar graphs in four pages, Journal of Computer and System Sciences, v.38 n.1, p.36-67, February 1989 [doi〉10.1016/0022-0000(89)90032-9]