Classifying molecular sequences using a linkage graph with their pairwise similarities
Theoretical Computer Science - Special issue: Genome informatics
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On mining cross-graph quasi-cliques
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
Grapheur: a software architecture for reactive and interactive optimization
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Computational challenges with cliques, quasi-cliques and clique partitions in graphs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On the maximum quasi-clique problem
Discrete Applied Mathematics
Online search of overlapping communities
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
The problem of finding a maximum clique in a graph is prototypical for many clustering and similarity problems; however, in many real-world scenarios, the classical problem of finding a complete subgraph needs to be relaxed to finding an almost complete subgraph, a so-called quasi-clique . In this work, we demonstrate how two previously existing definitions of quasi-cliques can be unified and how the resulting, more general quasi-clique finding problem can be solved by extending two state-of-the-art stochastic local search algorithms for the classical maximum clique problem. Preliminary results for these algorithms applied to both, artificial and real-world problem instances demonstrate the usefulness of the new quasi-clique definition and the effectiveness of our algorithms.