Trapezoid graphs and generalizations, geometry and algorithms

Discrete Applied Mathematics

Volumn 74, Issue 1, 1997, Pages 13-32

  Felsner, Stefan ^a,b   Müller, Rudolf ^c   Wernisch, Lorenz ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Algorithms; Order dimension: Trapezoid graphs; Partially ordered sets

Indexed keywords

EID: 0006980305     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00013-3     Document Type: Article

References (12)

1. 0.5) Inf. Proc. Lett. 37 (1991) 237-240.
2. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, 1989).
3. I. Dagan, M.C. Golumbic and R.Y. Pinter, Trapezoid graphs and their coloring Discrete Appl. Math. 21 (1988) 35-46.
4. M.L. Fredman, On computing the length of longest increasing subsequences Discrete Math. 11 (1975) 29-35.
5. F. Gavril, Algorithms for a maximum clique and a maximum independent set of a circle graph, Networks 3 (1973) 361-273.
6. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
7. K. Mehlhorn, Data Structures and Algorithms 3. Multi-dimensional Searching and Computational Geometry (Springer, Berlin Heidelberg New York 1984).
8. R. McConnel and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of undirected graphs, Proc. 5. Ann. Symp. on Discr. Alg. (1994).
9. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood cliffs, NJ, 1983).
10. M. Smid, Range trees with slack parameter. Algorithms Rev. 2(2) (1991) 77-87.
11. W.T. Trotter, Combinatorics and Partially Ordered Sets: Dimension Theory (Johns Hopkins Press, 1991).
12. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inf. Proc. Lett. 6 (1977) 80-82.