Design of multithreaded algorithms for combinatorial problems

David A. Bader, Kamesh Madduri, Guojing Cong, John Feo

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Citations (Scopus)

Abstract

Graph theoretic and combinatorial problems arise in several traditional and emerging scientific disciplines such as VLSI design, optimization, databases, and computational biology. Some examples include phylogeny reconstruction [65,66], protein–protein interaction networks [89], placement and layout in VLSI chips [59], data mining [52,55], and clustering in semantic webs. Graph abstractions are also finding increasing relevance in the domain of large-scale network analysis [28,58]. Empirical studies show that many social and economic interactions tend to organize themselves in complex network structures. These networks may contain billions of vertices with degrees ranging from small constants to thousands [14,42].

Original languageEnglish (US)
Title of host publicationHandbook of Parallel Computing
Subtitle of host publicationModels, Algorithms and Applications
PublisherCRC Press
Pages31-1-31-30
ISBN (Electronic)9781420011296
ISBN (Print)9781584886235
DOIs
StatePublished - Jan 1 2007

Fingerprint

Design of Algorithms
Complex networks
Combinatorial Problems
Semantic Web
Electric network analysis
Data mining
VLSI Design
Economics
Phylogeny
Computational Biology
Network Analysis
Protein-protein Interaction
Graph in graph theory
Complex Structure
Network Structure
Complex Networks
Empirical Study
Placement
Layout
Data Mining

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Cite this

Bader, D. A., Madduri, K., Cong, G., & Feo, J. (2007). Design of multithreaded algorithms for combinatorial problems. In Handbook of Parallel Computing: Models, Algorithms and Applications (pp. 31-1-31-30). CRC Press. https://doi.org/10.1201/9781420011296
Bader, David A. ; Madduri, Kamesh ; Cong, Guojing ; Feo, John. / Design of multithreaded algorithms for combinatorial problems. Handbook of Parallel Computing: Models, Algorithms and Applications. CRC Press, 2007. pp. 31-1-31-30
@inbook{6dbde160b61c4daf99672aece3e794c0,
title = "Design of multithreaded algorithms for combinatorial problems",
abstract = "Graph theoretic and combinatorial problems arise in several traditional and emerging scientific disciplines such as VLSI design, optimization, databases, and computational biology. Some examples include phylogeny reconstruction [65,66], protein–protein interaction networks [89], placement and layout in VLSI chips [59], data mining [52,55], and clustering in semantic webs. Graph abstractions are also finding increasing relevance in the domain of large-scale network analysis [28,58]. Empirical studies show that many social and economic interactions tend to organize themselves in complex network structures. These networks may contain billions of vertices with degrees ranging from small constants to thousands [14,42].",
author = "Bader, {David A.} and Kamesh Madduri and Guojing Cong and John Feo",
year = "2007",
month = "1",
day = "1",
doi = "10.1201/9781420011296",
language = "English (US)",
isbn = "9781584886235",
pages = "31--1--31--30",
booktitle = "Handbook of Parallel Computing",
publisher = "CRC Press",

}

Bader, DA, Madduri, K, Cong, G & Feo, J 2007, Design of multithreaded algorithms for combinatorial problems. in Handbook of Parallel Computing: Models, Algorithms and Applications. CRC Press, pp. 31-1-31-30. https://doi.org/10.1201/9781420011296

Design of multithreaded algorithms for combinatorial problems. / Bader, David A.; Madduri, Kamesh; Cong, Guojing; Feo, John.

Handbook of Parallel Computing: Models, Algorithms and Applications. CRC Press, 2007. p. 31-1-31-30.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Design of multithreaded algorithms for combinatorial problems

AU - Bader, David A.

AU - Madduri, Kamesh

AU - Cong, Guojing

AU - Feo, John

PY - 2007/1/1

Y1 - 2007/1/1

N2 - Graph theoretic and combinatorial problems arise in several traditional and emerging scientific disciplines such as VLSI design, optimization, databases, and computational biology. Some examples include phylogeny reconstruction [65,66], protein–protein interaction networks [89], placement and layout in VLSI chips [59], data mining [52,55], and clustering in semantic webs. Graph abstractions are also finding increasing relevance in the domain of large-scale network analysis [28,58]. Empirical studies show that many social and economic interactions tend to organize themselves in complex network structures. These networks may contain billions of vertices with degrees ranging from small constants to thousands [14,42].

AB - Graph theoretic and combinatorial problems arise in several traditional and emerging scientific disciplines such as VLSI design, optimization, databases, and computational biology. Some examples include phylogeny reconstruction [65,66], protein–protein interaction networks [89], placement and layout in VLSI chips [59], data mining [52,55], and clustering in semantic webs. Graph abstractions are also finding increasing relevance in the domain of large-scale network analysis [28,58]. Empirical studies show that many social and economic interactions tend to organize themselves in complex network structures. These networks may contain billions of vertices with degrees ranging from small constants to thousands [14,42].

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

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

U2 - 10.1201/9781420011296

DO - 10.1201/9781420011296

M3 - Chapter

AN - SCOPUS:84969288000

SN - 9781584886235

SP - 31-1-31-30

BT - Handbook of Parallel Computing

PB - CRC Press

ER -

Bader DA, Madduri K, Cong G, Feo J. Design of multithreaded algorithms for combinatorial problems. In Handbook of Parallel Computing: Models, Algorithms and Applications. CRC Press. 2007. p. 31-1-31-30 https://doi.org/10.1201/9781420011296