An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs
In this paper, we first show how a certein ordering of vertices, called bicompatible elimination ordering (BCO), of a proper interval graph (PIG) can be used to solve optimally the following problems: finding Hamiltonian cycle in a Hamiltonian PIG, the set of articulation points and bridges, and the single source or all pair shortest paths. We then propose an NC parallel algorithm (i.e., polylogarithmic-time employing a polynomial number of processors) to compute a BCO of a proper interval graph.
KeywordsLeaf Node Parallel Algorithm Hamiltonian Cycle Interval Graph Chordal Graph
Unable to display preview. Download preview PDF.
- P. Buneman, The recovery of trees from measures of dissimilarity, in: mathematics in the Archaeological and Historical Sciences, Edinburg University Press, Edinburg (1972) 387–395.Google Scholar
- M.R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company (1979).Google Scholar
- R. E. Jamison and R. Laskar, Elimination orderings of chordal graphs, in “Proc. of the seminar on Combinatorics and applications,” ( K. S. Vijain and N. M. Singhi eds. 1982) ISI, Calcutta, pp. 192–200.Google Scholar
- F. S. Roberts, Indifferences graphs, in:“Proof Techniques in Graph Theory”, (F. Harary ed.) 1971, pp.139–146, Academic Press.Google Scholar
- D. Rose, A graph theoretic study of the numerical solution of sparse positive definite systems of linear equations: in R. Read ed, Graph Theory and Computing ( Academic Press, New York, 1972) 183–217.Google Scholar