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 Scopus citations

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

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Design of multithreaded algorithms for combinatorial problems'. Together they form a unique fingerprint.

Cite this