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

Authors:
B. S. Panda;Sajal K. Das
Affiliations:
Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India;Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX 76019, USA
Venue:
Information Processing Letters
Year:
2009

Citing 11
Cited 0

Intersection graphs of paths in a tree

Journal of Combinatorial Theory Series B
Some parallel algorithms on interval graphs

Discrete Applied Mathematics
Parallel merge sort

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

Information Processing Letters
New sequential and parallel algorithms for interval graph recognition

Information Processing Letters
Optimal parallel algorithms for finding cut vertices and bridges of interval graphs

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
An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
A linear time recognition algorithm for proper interval graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we first show how a certain ordering of vertices, called bicompatible elimination ordering (BCO), of a proper interval graph can be used to solve efficiently several problems in proper interval graphs. We, then, propose an NC parallel algorithm (i.e., polylogarithmic-time employing a polynomial number of processors) in SIMD CRCW PRAM (Single Instruction Stream Multiple Data Stream Concurrent Read Concurrent Write Parallel Random Access Machine) model of parallel computation to compute a BCO of a proper interval graph. To the best of our knowledge, this is the first NC parallel algorithm to compute a BCO of a proper interval graph.