Orderly spanning trees with applications

SIAM Journal on Computing

Volumn 34, Issue 4, 2005, Pages 924-945

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

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Canonical ordering; Data compression; Graph drawing; Graph encoding; Orderly spanning tree; Planar graph algorithm; Realizer; Succinct data structure; Triangulation; Unit cost RAM model; Visibility representation

Indexed keywords

ALGORITHMS; DATA COMPRESSION; GRAPH THEORY; MATHEMATICAL MODELS; THEOREM PROVING;

CANONICAL ORDERING; GRAPH DRAWING; GRAPH ENCODING; PLANAR GRAPH ALGORITHM; SUCCINCT DATA STRUCTURE; TRIANGULATION; UNIT-COST RAM MODEL; VISIBILITY REPRESENTATION;

TREES (MATHEMATICS);

EID: 24344489468     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702411381     Document Type: Article

References (47)

1. T. C. BELL, J. G. CLEARY, AND I. H. WITTEN, Text Compression, Prentice-Hall, Englewood Cliffs, NJ, 1990.
2. N. BONICHON, C. GAVOILLE, AND N. HANUSSE, An information-theoretic upper bound of planar graphs using triangulation, in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 2607, Springer-Verlag, Berlin, 2003, pp. 499-510.
3. P. BOSE, A. M. DEAN, AND J. P. HUTCHINSON, On rectangle visibility graphs, in Proceedings of the 4th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 1190, Springer-Verlag, Berlin, 1996, pp. 25-44.
4. J. BOYER AND W. MYRVOLD, Stop minding your p's and q's: A simplified O(n) planar embedding algorithm, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1999, pp. 140-146.
5. A. BRODNIK AND J. I. MUNRO, Membership in constant time and almost-minimum space, SIAM J. Comput., 28 (1999), pp. 1627-1640.
6. H.-L. CHEN, C.-C. LIAO, H.-I. Lu, AND H.-C. YEN, Some applications of orderly spanning trees in graph drawing, in Proceedings of the 10th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 2528, Springer-Verlag, Berlin, 2002, pp. 332-343.
7. M. CHROBAK AND S.-I. NAKANO, Minimum-width grid drawings of plane graphs, Comput. Geom., 11 (1998), pp. 29-54.
8. M. CHROBAK AND T. H. PAYNE, A linear-time algorithm for drawing a planar graph on a grid, Inform. Process. Lett. 54 (1995), pp. 241-246.
9. R. C.-N. CHUANG, A. GARG, X. HE, M.-Y. KAO, AND H.-I. Lu, Compact encodings of planar graphs via canonical ordering and multiple parentheses, in Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, K. G. Larsen, S. Skyum, and G. Winskel, eds., Lecture Notes in Comput. Sci. 1443, Springer-Verlag, Berlin, 1998, pp. 118-129.
10. D. R. CLARK, Compact PAT Trees, Ph.D. thesis, University of Waterloo, Ontario, Canada, 1996.
11. H. DE FRAYSSEIX, J. PACH, AND R. POLLACK, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51.
12. A. M. DEAN AND J. P. HUTCHINSON, Rectangle-visibility representations of bipartite graphs, Discrete Appl. Math., 75 (1997), pp. 9-25.
13. A. M. DEAN AND J. P. HUTCHINSON, Rectangle-visibility layouts of unions and products of trees, J. Graph Algorithms Appl. 2 (1998), pp. 1-21.
14. B. DUSHNIK AND E. W. MILLER, Partially ordered sets, Amer. J. Math., 63 (1941), pp. 600-610.
15. P. ELIAS, Universal codeword sets and representations of the integers, IEEE Trans. Inform. Theory, 21 (1975), pp. 194-203.
16. U. FÖßMEIER, G. KANT, AND M. KAUFMANN, 2-visibility drawings of planar graphs, in Proceedings of the 4th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 1190, Springer-Verlag, Berlin, 1996, pp. 155-168.
17. M. L. FREDMAN AND D. E. WILLARD, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. System Sci., 48 (1994), pp. 533-551.
18. C. GAVOILLE AND N. HANUSSE, Compact routing tables for graphs of bounded genus, in Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, J. Wiedermann, P. van Emde Boas, and M. Nielsen, eds., Lecture Notes in Comput. Sci. 1644, Springer-Verlag, Berlin, 1999, pp. 351-360.
19. D. HAREL AND M. SARDAS, An algorithm for straight-line drawing of planar graphs, Algorithmica, 20 (1998), pp. 119-135.
20. X. HE, On floor-plan of plane graphs, SIAM J. Comput., 28 (1999), pp. 2150-2167.
21. X. HE, M.-Y. KAO, AND H.-I. LU, A fast general methodology for information-theoretically optimal encodings for graphs, in Proceedings of the 7th Annual European Symposium on Algorithms, J. Nešetřil, ed., Lecture Notes in Comput. Sci. 1643, Springer-Verlag, Berlin, 1999, pp. 540-549.
22. X. HE, M.-Y. KAO, AND H.-I. LU, Linear-time succinct encodings of planar graphs via canonical orderings, SIAM J. Discrete Math., 12 (1999), pp. 317-325.
23. X. HE, M.-Y. KAO, AND H.-I. LU, A fast general methodology for information-theoretically optimal encodings of graphs, SIAM J. Comput., 30 (2000), pp. 838-846.
24. J. HOPCOFT AND R. E. TARJAN, Efficient planrity testing, J. ACM, 21 (1974), pp. 549-568.
25. J. P. HUTCHINSON, T. SHERMER, AND A. VINCE, On representations of some thickness-two graphs, Comput. Geom., 13 (1999), pp. 161-171.
26. IEEE, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1997.
27. G. KANT, Drawing planar graphs using the canonical ordering, Algorithmica, 16 (1996), pp. 4-32.
28. G. KANT AND X. HE, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci., 172 (1997), pp. 175-193.
29. K. KEELER AND J. WESTBROOK, Short encodings of planar graphs and maps, Discrete Appl. Math., 58 (1995), pp. 239-252.
30. C.-C. LIAO, H.-I. LU, AND H.-C. YEN, Floor-planning via orderly spanning trees, in Proceedings of the 9th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 2265, Springer-Verlag, Berlin, 2001, pp. 367-377.
31. C.-C. LIAO, H.-I. LU, AND H.-C. YEN, Compact floor-planning via orderly spanning trees, J. Algorithms, 48 (2003), pp. 441-451.
32. C.-C. LIN, H.-I. LU, AND I.-F. SUN, Improved compact visibility representation of planar graph via Schnyder's realizer, SIAM J. Discrete Math., 18 (2004), pp. 19-29.
33. H.-I. LU, Improved compact routing tables for planar networks via orderly spanning trees, in Proceedings of the 8th Annual International Computing and Combinatorics Conference, Lecture Notes in Comput. Sci. 2387, Springer-Verlag, Berlin, 2002, pp. 57-66.
34. H.-I. LU, Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2002, pp. 223-224.
35. J. I. MUNRO AND V. RAMAN, Succinct representation of balanced parentheses and static trees, SIAM J. Comput., 31 (2001), pp. 762-776.
36. S. NORTH, ed., Proceedings of the 4th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 1190, Springer-Verlag, Berlin, 1996.
37. J. ROSSIGNAC, Edgebreaker: Connectivity compression for triangle meshes, IEEE Trans. Visualization and Computer Graphics, 5 (1999), pp. 47-61.
38. W. SCHNYDER, Planar graphs and poset dimension, Order, 5 (1989), pp. 323-343.
39. W. SCHNYDER, Embedding planar graphs on the grid, in Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1990, pp. 138-148.
40. M. THORUP, Undirected single source shortest paths in linear time, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1997, pp. 12-21.
41. M. THORUP, On RAM priority queues, SIAM J. Comput., 30 (2000), pp. 86-109.
42. W. T. TROTTER, Combinatorics and Partially Ordered Sets - Dimension Theory, Johns Hopkins University Press, Baltimore, MD, 1992.
43. G. TURÁN, On the succinct representation of graphs, Discrete Appl. Math., 8 (1984), pp. 289-294.
44. W. T. TUTTE, A census of planar maps, Canad. J. Math., 15 (1963), pp. 249-271.
45. P. VAN EMDE BOAS, Machine models and simulations, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 1-60.
46. M. YANNAKAKIS, Embedding planar graphs in four pages, J. Comput. System Sci., 38 (1989), pp. 36-67.
47. K.-H. YEAP AND M. SARRAFZADEH, Floor-planning by graph dualization: 2-concave rectilinear modules, SIAM J. Comput., 22 (1993), pp. 500-526.