Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph

Authors:
Mahnhoon Lee;Sridhar Radhakrishnan
Affiliations:
Department of Computing Science, Thompson Rivers University, Kamloops, BC, Canada;School of Computer Science, University of Oklahoma, Norman, OK
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 5
Cited 0

Parallel merge sort

SIAM Journal on Computing
An introduction to parallel algorithms

An introduction to parallel algorithms
Synthesis of Parallel Algorithms

Synthesis of Parallel Algorithms
Dually Chordal Graphs

WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithms and characterizations of special graphs in the chordal hierarchy

Algorithms and characterizations of special graphs in the chordal hierarchy

Quantified Score

Hi-index	0.04

Visualization

Abstract

The class of doubly chordal graphs, which is a subclass of chordal graphs and a superclass of strongly chordal graphs, arises in many application areas. Many NP-complete optimization problems on chordal graphs like domination and Steiner tree can be solved in polynomial time on doubly chordal graphs using doubly perfect elimination ordering of vertices. In this paper, we show that the computation of a doubly perfect elimination ordering in a doubly chordal graph with n vertices and m edges can be done in O(log2 n) time using O(n + m) processors on the CRCW PRAM model.