A novel multithreaded algorithm for extracting maximal chordal subgraphs

Mahantesh Halappanavar, John Feo, Kathryn M Cooper, Hesham H Ali, Sanjukta Bhowmick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

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 this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph. We develop an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it per iteration and implement our algorithm on two different multithreaded architectures - Cray XMT, a massively multithreaded platform, and AMD Magny-Cours, a shared memory multicore platform. In addition to the proof of correctness, we present the performance of our algorithm using a test set of synthetical graphs with up to half-a-billion edges and real world networks from gene correlation studies and demonstrate that our algorithm achieves high scalability for all inputs on both types of architectures.

Original languageEnglish (US)
Title of host publicationProceedings - 41st International Conference on Parallel Processing, ICPP 2012
Pages58-67
Number of pages10
DOIs
StatePublished - Dec 20 2012
Event41st International Conference on Parallel Processing, ICPP 2012 - Pittsburgh, PA, United States
Duration: Sep 10 2012Sep 13 2012

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Conference

Conference41st International Conference on Parallel Processing, ICPP 2012
CountryUnited States
CityPittsburgh, PA
Period9/10/129/13/12

Fingerprint

Subgraph
Chordal Graphs
Graph in graph theory
Maximum Clique
Proof of correctness
Combinatorial optimization
Test Set
Chord or secant line
Shared Memory
Chromatic number
Combinatorial Optimization Problem
Thread
Scalability
Polynomial time
NP-complete problem
Genes
Update
Polynomials
Gene
Iteration

Keywords

  • chordal graphs
  • large scale networks
  • multithreaded algorithms

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Halappanavar, M., Feo, J., Cooper, K. M., Ali, H. H., & Bhowmick, S. (2012). A novel multithreaded algorithm for extracting maximal chordal subgraphs. In Proceedings - 41st International Conference on Parallel Processing, ICPP 2012 (pp. 58-67). [6337567] (Proceedings of the International Conference on Parallel Processing). https://doi.org/10.1109/ICPP.2012.10

A novel multithreaded algorithm for extracting maximal chordal subgraphs. / Halappanavar, Mahantesh; Feo, John; Cooper, Kathryn M; Ali, Hesham H; Bhowmick, Sanjukta.

Proceedings - 41st International Conference on Parallel Processing, ICPP 2012. 2012. p. 58-67 6337567 (Proceedings of the International Conference on Parallel Processing).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Halappanavar, M, Feo, J, Cooper, KM, Ali, HH & Bhowmick, S 2012, A novel multithreaded algorithm for extracting maximal chordal subgraphs. in Proceedings - 41st International Conference on Parallel Processing, ICPP 2012., 6337567, Proceedings of the International Conference on Parallel Processing, pp. 58-67, 41st International Conference on Parallel Processing, ICPP 2012, Pittsburgh, PA, United States, 9/10/12. https://doi.org/10.1109/ICPP.2012.10
Halappanavar M, Feo J, Cooper KM, Ali HH, Bhowmick S. A novel multithreaded algorithm for extracting maximal chordal subgraphs. In Proceedings - 41st International Conference on Parallel Processing, ICPP 2012. 2012. p. 58-67. 6337567. (Proceedings of the International Conference on Parallel Processing). https://doi.org/10.1109/ICPP.2012.10
Halappanavar, Mahantesh ; Feo, John ; Cooper, Kathryn M ; Ali, Hesham H ; Bhowmick, Sanjukta. / A novel multithreaded algorithm for extracting maximal chordal subgraphs. Proceedings - 41st International Conference on Parallel Processing, ICPP 2012. 2012. pp. 58-67 (Proceedings of the International Conference on Parallel Processing).
@inproceedings{0f431945b39e499894fe4c089f5a9394,
title = "A novel multithreaded algorithm for extracting maximal chordal subgraphs",
abstract = "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 this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph. We develop an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it per iteration and implement our algorithm on two different multithreaded architectures - Cray XMT, a massively multithreaded platform, and AMD Magny-Cours, a shared memory multicore platform. In addition to the proof of correctness, we present the performance of our algorithm using a test set of synthetical graphs with up to half-a-billion edges and real world networks from gene correlation studies and demonstrate that our algorithm achieves high scalability for all inputs on both types of architectures.",
keywords = "chordal graphs, large scale networks, multithreaded algorithms",
author = "Mahantesh Halappanavar and John Feo and Cooper, {Kathryn M} and Ali, {Hesham H} and Sanjukta Bhowmick",
year = "2012",
month = "12",
day = "20",
doi = "10.1109/ICPP.2012.10",
language = "English (US)",
isbn = "9780769547961",
series = "Proceedings of the International Conference on Parallel Processing",
pages = "58--67",
booktitle = "Proceedings - 41st International Conference on Parallel Processing, ICPP 2012",

}

TY - GEN

T1 - A novel multithreaded algorithm for extracting maximal chordal subgraphs

AU - Halappanavar, Mahantesh

AU - Feo, John

AU - Cooper, Kathryn M

AU - Ali, Hesham H

AU - Bhowmick, Sanjukta

PY - 2012/12/20

Y1 - 2012/12/20

N2 - 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 this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph. We develop an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it per iteration and implement our algorithm on two different multithreaded architectures - Cray XMT, a massively multithreaded platform, and AMD Magny-Cours, a shared memory multicore platform. In addition to the proof of correctness, we present the performance of our algorithm using a test set of synthetical graphs with up to half-a-billion edges and real world networks from gene correlation studies and demonstrate that our algorithm achieves high scalability for all inputs on both types of architectures.

AB - 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 this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph. We develop an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it per iteration and implement our algorithm on two different multithreaded architectures - Cray XMT, a massively multithreaded platform, and AMD Magny-Cours, a shared memory multicore platform. In addition to the proof of correctness, we present the performance of our algorithm using a test set of synthetical graphs with up to half-a-billion edges and real world networks from gene correlation studies and demonstrate that our algorithm achieves high scalability for all inputs on both types of architectures.

KW - chordal graphs

KW - large scale networks

KW - multithreaded algorithms

UR - http://www.scopus.com/inward/record.url?scp=84871155052&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871155052&partnerID=8YFLogxK

U2 - 10.1109/ICPP.2012.10

DO - 10.1109/ICPP.2012.10

M3 - Conference contribution

SN - 9780769547961

T3 - Proceedings of the International Conference on Parallel Processing

SP - 58

EP - 67

BT - Proceedings - 41st International Conference on Parallel Processing, ICPP 2012

ER -