A Novel Multithreaded Algorithm for Extracting Maximal Chordal Subgraphs

Chordal graphs are triangulated graphs where any cycle larger than three is bisected by a chord. Many combinatorial optimization problems such as computing the size of the maximum clique and the chromatic number are NP-hard on general graphs but have polynomial time solutions on chordal graphs. In t...

Full description

Bibliographic Details

Published in:	2012 41st International Conference on Parallel Processing pp. 58 - 67
Main Authors:	Halappanavar, M., Feo, J., Dempsey, K., Ali, H., Bhowmick, S.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2012
Subjects:	Algorithm design and analysis Biology chordal graphs Correlation Instruction sets large scale networks multithreaded algorithms Partitioning algorithms Sockets
ISBN:	9781467325080, 1467325082
ISSN:	0190-3918
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!