Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
In this paper we address the problem of designing O(n) space representations for permutation and interval graphs that provide the neighborhood of any vertex in O(d) time, where d is its degree. To that purpose, we introduce a new parameter, called linearity, that would solve the problem if bounded for the two classes. Surprisingly, we show that it is not. Nevertheless, we design representations with the desired property for the two classes, and we implement the Breadth-First Search algorithm in O(n) time for permutation graphs; thereby lowering the complexity of All Pairs Shortest Paths and Single Source Shortest Path problems for the class.
Unable to display preview. Download preview PDF.
- 3.Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)Google Scholar
- 4.Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC 1984, pp. 135–143 (1984)Google Scholar
- 7.Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, 2nd edn., vol. 57. Elsevier, Amsterdam (2004)Google Scholar
- 8.Harel, D.: A linear time algorithm for the lowest common ancestors problem (extended abstract). In: FOCS 1980, pp. 308–319 (1980)Google Scholar
- 10.Roberts, F.S.: Representations of Indifference Relations. PhD thesis, Stanford University (1968)Google Scholar
- 11.Spinrad, J.P.: Efficient graph representations. Fields Institute Monographs, vol. 19. American Mathematical Society (2003)Google Scholar