Lower Bounds on Paraclique Density

Authors

Ronald D. Hagan, University of Tennessee, Knoxville
Michael A. Langston, University of Tennessee, KnoxvilleFollow
Kai Wang, Georgia Southern UniversityFollow

Document Type

Article

Publication Date

5-11-2016

Publication Title

Discrete Applied Mathematics

DOI

10.1016/j.dam.2015.11.010

ISSN

0166-218X

Abstract

The scientific literature teems with clique-centric clustering strategies. In this paper we analyze one such method, the paraclique algorithm. Paraclique has found practical utility in a variety of application domains, and has been successfully employed to reduce the effects of noise. Nevertheless, its formal analysis and worst-case guarantees have remained elusive. We address this issue by deriving a series of lower bounds on paraclique densities.

Recommended Citation

Hagan, Ronald D., Michael A. Langston, Kai Wang. 2016. "Lower Bounds on Paraclique Density." Discrete Applied Mathematics, 204: 208-212. doi: 10.1016/j.dam.2015.11.010
https://digitalcommons.georgiasouthern.edu/compsci-facpubs/54