This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
High-Performance Computing on the Information Superhighway, HPC-Asia '97
Parallel Recognition of Doubly Chordal Graphs
Seoul, Korea
April 28-May 02
ISBN: 0-8186-7901-8
ASCII Text
x 
 
Mahnhoon Lee, R. Sridhar, C.N. Sekharan, "Parallel Recognition of Doubly Chordal Graphs," High Performance Computing and Grid in Asia Pacific Region, International Conference on, pp. 373, High-Performance Computing on the Information Superhighway, HPC-Asia '97, 1997.
 
 
BibTex
x
 
@article{ 10.1109/HPC.1997.592176,
author = {Mahnhoon Lee and R. Sridhar and C.N. Sekharan},
title = {Parallel Recognition of Doubly Chordal Graphs},
journal ={High Performance Computing and Grid in Asia Pacific Region, International Conference on},
volume = {0},
year = {1997},
isbn = {0-8186-7901-8},
pages = {373},
doi = {http://doi.ieeecomputersociety.org/10.1109/HPC.1997.592176},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - High Performance Computing and Grid in Asia Pacific Region, International Conference on
TI - Parallel Recognition of Doubly Chordal Graphs
SN - 0-8186-7901-8
SP
EP
A1 - Mahnhoon Lee,
A1 - R. Sridhar,
A1 - C.N. Sekharan,
PY - 1997
VL - 0
JA - High Performance Computing and Grid in Asia Pacific Region, International Conference on
ER -
 
Mahnhoon Lee, AIN Switching Section
R. Sridhar, University of Oklahoma
C.N. Sekharan, Loyola University of Chicago
The class of doubly chordal graphs is a subclass of chordal graphs and a superclass of strongly chordal graphs, which arise in many application areas. Many optimization problems like domination and Steiner tree which are NP-complete on chordal graphs can be solved in polynomial time on doubly chordal graphs. We investigate several characterizations and properties of doubly chordal graphs. Using these properties we show that the recognition of a doubly chordal graph with n vertices and m edges and the generation of a doubly perfect elimination ordering can be done in O(\log^2n) time using O(nm) processors on the CRCW PRAM model.
Citation:
Mahnhoon Lee, R. Sridhar, C.N. Sekharan, "Parallel Recognition of Doubly Chordal Graphs," hpcasia, pp.373, High-Performance Computing on the Information Superhighway, HPC-Asia '97, 1997
Usage of this product signifies your acceptance of the Terms of Use.