Clique relaxation models in social network analysis

60Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Clique relaxation models that were originally introduced in the literature on social network analysis are not only gaining increasing popularity in a wide spectrum of complex network applications, but also keep garnering attention of mathematicians, computer scientists, and operations researchers as a promising avenue for fruitful theoretical investigations. This chapter describes the origins of clique relaxation concepts and provides a brief overview of mathematical programming formulations for the corresponding optimization problems, algorithms proposed to solve these problems, and selected real-life applications of the models of interest.

Cite

CITATION STYLE

APA

Pattillo, J., Youssef, N., & Butenko, S. (2012). Clique relaxation models in social network analysis. In Springer Optimization and Its Applications (Vol. 58, pp. 143–162). Springer International Publishing. https://doi.org/10.1007/978-1-4614-0857-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free