Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
Journal of Graph Theory
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
On maximum clique problems in very large graphs
External memory algorithms
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
A Cluster-based Approach for Routing in Ad-Hoc Networks
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
INFORMS Journal on Computing
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Mining market data: a network approach
Computers and Operations Research
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
Journal of Global Optimization
The Co-2-plex Polytope and Integral Systems
SIAM Journal on Discrete Mathematics
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
Combinatorial algorithms for the maximum k-plex problem
Journal of Combinatorial Optimization
A new table of constant weight codes
IEEE Transactions on Information Theory
An algorithm for finding a maximum clique in a graph
Operations Research Letters
An exact algorithm for the maximum clique problem
Operations Research Letters
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Journal of Combinatorial Optimization
Hi-index | 0.00 |
Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property 驴 that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable. This paper proposes a general purpose exact algorithmic framework to solve this problem and investigates key algorithm design and implementation issues that are helpful in tailoring the general framework for specific graph properties. The performance of the algorithms so derived for the maximum s-plex and the maximum s-defective clique problems, which arise in network-based data mining applications, is assessed through a computational study.