Classifying molecular sequences using a linkage graph with their pairwise similarities
Theoretical Computer Science - Special issue: Genome informatics
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
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Exact bounds on the order of the maximum clique of a graph
Discrete Applied Mathematics
On mining cross-graph quasi-cliques
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Effective Pruning Techniques for Mining Quasi-Cliques
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
On Effectively Finding Maximal Quasi-cliques in Graphs
Learning and Intelligent Optimization
Mining the Largest Quasi-clique in Human Protein Interactome
ICAIS '09 Proceedings of the 2009 International Conference on Adaptive and Intelligent Systems
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
Approximating 2-cliques in unit disk graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
Given a simple undirected graph G=(V,E) and a constant @c@?(0,1), a subset of vertices is called a @c-quasi-clique or, simply, a @c-clique if it induces a subgraph with the edge density of at least @c. The maximum @c-clique problem consists in finding a @c-clique of largest cardinality in the graph. Despite numerous practical applications, this problem has not been rigorously studied from the mathematical perspective, and no exact solution methods have been proposed in the literature. This paper, for the first time, establishes some fundamental properties of the maximum @c-clique problem, including the NP-completeness of its decision version for any fixed @c satisfying 0