Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs

  • Panos M. Pardalos
  • Steffen Rebennack
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6049)

Abstract

During the last decade, many problems in social, biological, and financial networks require finding cliques, or quasi-cliques. Cliques or clique partitions have also been used as clustering or classification tools in data sets represented by networks. These networks can be very large and often massive and therefore external (or semi-external) memory algorithms are needed. We discuss four applications where we identify computational challenges which are both of practical and theoretical interest.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Panos M. Pardalos
    • 1
  • Steffen Rebennack
    • 1
  1. 1.Center for Applied Optimization, Department of Industrial & Systems EngineeringUniversity of FloridaUSA

Personalised recommendations