On Crossing Sets, Disjoint Sets, and Pagenumber

Journal of Algorithms

Volumn 34, Issue 1, 2000, Pages 40-53

  Shahrokhi, Farhad ^a   Shi, Weiping ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003062211     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1049     Document Type: Article

References (25)

1. P. K. Agarwal, B. Arnov, J. Pach, R. Pollack, and M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1997), 1-9.
2. N. Alon and P. Erdos, Disjoint edges in geometric graphs, Disc. Comput. Geom. 4 (1989), 287-290.
3. N. Alon, J. H. Spencer, and P. Erdos, "The Probabilistic Method," Wiley, New York, 1992.
4. F. Bernhart and B. Kainen, The book thickness of a graph, J. Combin. Theory B 27 (1979), 320-331.
5. V. Capoyleas and J. Pach, A Turan type theorem on chords of a convex polygon, J. Combin Theory B 56 (1992), 9-15.
6. F. R. K. Chung, F. T. Leighton, and A. Rosenberg, Embedding graphs in books: A layout problem with applications to VLSI design, SIAM J. Alg. Disc. Meth. 8 (1987), 33-58.
7. R. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. Ser. 2 51 (1950), 26-32.
8. M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou, The complexity of coloring circular arc graphs and chords, SIAM J. Alg. Disc. Meth. 1 (1980), 33-58.
9. W. Feller, "An Introduction to Probability Theory and Its Applications," Wiley, New York, 1968.
10. L. S. Heath and S. Istrail, The pagenumber of genus g graph is O(g), J. Assoc. Comput. Mach. 39 (1992), 479-500.
11. L. S. Heath, F. T. Leighton, and A. L. Rosenberg, Comparing queues and stacks as mechanisms for laying out graphs, SIAM J. Disc. Math. 5 (1992), 398-412.
12. L. S. Heath and A. L. Rosenberg, Laying out graphs using queues, SIAM J. Comput. 21 (1992), 927-958.
13. S. M. Malitz, On the pagenumber of graphs, J. Algorithms 17 (1994), 71-84.
14. S. M. Malitz, Genus g graphs have pagenumber O(√g), J. Algorithms 17 (1994), 85-109.
15. D. W. Matula and L. L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, J. Assoc. Comput. Mach. 30 (1983), 417-427.
16. J. Pach and P. K. Agarwal, "Combinatorial Geometry," Wiley, New York, 1995.
17. J. Pach, F. Schahrokhi, and M. Szegedy, Applications of crossing numbers, Algorithmica 16(1996), 111-117.
18. J. Pach and J. Töröcsik, Some geometric applications of Dilworth's theorem, Disc. Comput. Geometry 21 (1994), 1-7.
19. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci. 37 (1988), 130-143.
20. A. L. Rosenberg, The Diogenes approach to fault-tolerant arrays of processors, IEEE Trans. Comput. 32 (1983), 902-910.
21. P. Rosenstiehl and R. E. Tarjan, Gauss codes, planar Hamiltonian graphs and stack-sortable permutations, J. Algorithms 5 (1984), 375-390.
22. G. Szekeres and H. S. Wilf, An inequality for the chromatic number of a graph, J. Combin. Theory 4 (1968), 1-3.
23. L. Valiant, On the complexity of counting the matching, Theoret. Comput. Sci. 8 (1979), 189-201.
24. M. Yannakakis, Embedding planar graphs in four pages, J. Comput. System Sci. 38 (1989), 36-67.
25. P. Valtr, On geometric graphs with no k pairwise parallel edges, Disc. Comput. Geom. 19 (1998), 461-469.