Computational challenges with cliques, quasi-cliques and clique partitions in graphs

Authors:
Panos M. Pardalos;Steffen Rebennack
Affiliations:
Center for Applied Optimization, Department of Industrial S Systems Engineering, University of Florida;Center for Applied Optimization, Department of Industrial S Systems Engineering, University of Florida
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 12
Cited 1

Algorithms for the identifications of three-dimensional maximal common substructures

Journal of Chemical Information & Computer Sciences
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On maximum clique problems in very large graphs

External memory algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast heuristics for large scale covering-location problems

Computers and Operations Research - Location analysis
Massive Quasi-Clique Detection

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Probabilistic checking of proofs; a new characterization of NP

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Analyzing the Structure and Evolution of Massive Telecom Graphs

IEEE Transactions on Knowledge and Data Engineering
On Effectively Finding Maximal Quasi-cliques in Graphs

Learning and Intelligent Optimization
TeleComVis: Exploring Temporal Communities in Telecom Networks

ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
A Branch and Cut solver for the maximum stable set problem

Journal of Combinatorial Optimization

Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.