Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs
In this paper we consider a graph parameter called contiguity which aims at encoding a graph by a linear ordering of its vertices. We prove that the contiguity of cographs is unbounded but is always dominated by O(logn), where n is the number of vertices of the graph. And we prove that this bound is tight in the sense that there exists a family of cographs on n vertices whose contiguity is Ω(logn). In addition to these results on the worst-case contiguity of cographs, we design a linear-time constant-ratio approximation algorithm for computing the contiguity of an arbitrary cograph, which constitutes our main result. As a by-product of our proofs, we obtain a min-max theorem, which is worth of interest in itself, stating equality between the rank of a tree and the minimum height its path partitions.
KeywordsApproximation Algorithm Induction Hypothesis Rooted Tree Interval Graph Neighborhood Query
Unable to display preview. Download preview PDF.
- 2.Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW 2004, pp. 595–602. ACM (2004)Google Scholar
- 6.Brandstädt, A., Le, V., Spinrad, J.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)Google Scholar
- 7.Roberts, F.: Representations of indifference relations, Ph.D. thesis, Stanford University (1968)Google Scholar
- 8.Johnson, D., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large boolean matrices using reordering techniques. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, vol. 30, pp. 13–23 (2004)Google Scholar