An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs

Authors:
B. S. Panda;Sajal K. Das
Affiliations:
-;-
Venue:
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Year:
2002

Citing 7
Cited 1

Intersection graphs of paths in a tree

Journal of Combinatorial Theory Series B
Parallel merge sort

SIAM Journal on Computing
Counting clique trees and computing perfect elimination schemes in parallel

Information Processing Letters
Efficient Parallel Algorithms for Chordal Graphs

SIAM Journal on Computing
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.