Abstract
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter [DGP]. They propose an O(n 2) algorithm for chromatic number and a less efficient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, i.e., O(n log n), algorithms for chromatic number, weighted independent set, clique cover and maximum weighted clique on such graphs. We generalize trapezoid graphs to so called k-trapezoidal graphs. The ideas behind the clique cover and weighted independent set algorithms for trapezoid graphs carry over to higher dimensions. This leads to O(n logk−1 n) algorithms for k-trapezoidal graphs. We also propose a new class of graphs called circle trapezoid graphs. This class contains trapezoid graphs, circle graphs and circular-arc graphs as subclasses. We show that clique and independent set problems for circle trapezoid graphs are still polynomially solvable. The algorithms solving these two problems require algorithms for trapezoid graphs as subroutines.
The research of the first author was supported by DFG under grant FE-340/2-1. The research of the third author was supported by ALCOM project II.
This is an extended abstract of a full length article that will appear elsewhere.
An expanded version is avilable as preprint or ps-file at the authors.
Preview
Unable to display preview. Download preview PDF.
References
H. Alt, N. Blum, K. Mehlhorn and M. Paul, Computing a maximum cardinality matching in a bipartite graph in time O(n 1.5(m/logn).5), Inf. Proc. Letters 37 (1991), 237–240.
T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, 1989.
I. Dagan, M.C. Golumbic and R.Y. Pinter, Trapezoid Graphs and their Coloring, Discr. Appl. Math. 21 (1988), 35–46.
M.L. Fredman, On Computing the Length of Longest Increasing Subsequences, Discr. Math. 11 (1975), 29–35.
F. Gavril, Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph, Networks 3 (1973), 361–273.
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
E. Helly, Über die Menge konvexer Körper mit gemeinsamen Punkten, Jahresb. d. Dt. Mathem. Ver. 32 (1923).
R. McConnel and J. Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Undirected Graphs., Proc. 5. Annual Symp. on Discr. Alg. (1994).
C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1983.
P. van Embde Boas, Preserving order in a forest in less than logarithmic time and linear space„ Inf. Proc. Letters 6 (1977), 80–82.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Felsner, S., Müller, R., Wernisch, L. (1994). Trapezoid graphs and generalizations, geometry and algorithms. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-58218-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58218-2
Online ISBN: 978-3-540-48577-3
eBook Packages: Springer Book Archive