Trapezoid graphs and generalizations, geometry and algorithms

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

Volumn 824 LNCS, Issue , 1994, Pages 143-154

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

^a TELCORDIA TECHNOLOGIES   (United States)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Algorithms; Circle graphs; Circular arc graphs; Order dimension; Partially ordered sets; Trapezoid graphs

Indexed keywords

ALGORITHMS; GRAPHIC METHODS; SET THEORY;

CIRCLE GRAPHS; CIRCULAR-ARC GRAPH; ORDER DIMENSION; PARTIALLY ORDERED SET; TRAPEZOID GRAPHS;

GRAPH ALGORITHMS;

EID: 21344483481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58218-5_13     Document Type: Conference Paper

References (10)

1. 5), Inf. Proe. Letters 37 (1991), 237-240.
2. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, 1989.
3. I. Dagan, M.C. Golumbic and R.Y. Pinter, Trapezoid Graphs and their Coloring, Discr. AppL Math. 21 (1988), 35-46.
4. M.L. Fredman, On Computing the Length of Longest Increasing Subsequences, Discr. 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. E. Helly, Über die Menge konvexer Körper mit gemeinsamen Punkten, Jahresb. d. Dr. Mathem. Ver. 32 (1923).
8. R. McConnel and J. Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Undirected Graphs., Proc. 5. Annual Syrup. on Diser. Alg. (1994).
9. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1983.
10. P. van Embde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inf. Proe. Letters 6 (1977), 80-82.