Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
A practical clustering algorithm for static and dynamic information organization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Correlating summarization of multi-source news with k-way graph bi-clustering
ACM SIGKDD Explorations Newsletter
Discovering large dense subgraphs in massive graphs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
A method for pinpoint clustering of web pages with pseudo-clique search
Proceedings of the 2005 international conference on Federation over the Web
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
LCM ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining
Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Multi-way set enumeration in real-valued tensors
Proceedings of the 2nd Workshop on Data Mining using Matrices and Tensors
Ambiguous frequent itemset mining and polynomial delay enumeration
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
BISC: A bitmap itemset support counting approach for efficient frequent itemset mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mining frequent k-partite episodes from event sequences
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Closed and noise-tolerant patterns in n-ary relations
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
The problem of finding dense structures in a given graph is quite basic in informatics including data mining and data engineering. Clique is a popular model to represent dense structures, and widely used because of its simplicity and ease in handling. Pseudo cliques are natural extension of cliques which are subgraphs obtained by removing small number of edges from cliques. We here define a pseudo clique by a subgraph such that the ratio of the number of its edges compared to that of the clique with the same number of vertices is no less than a given threshold value. In this paper, we address the problem of enumerating all pseudo cliques for given a graph and a threshold value. We first show that it seems to be difficult to obtain polynomial time algorithms using straightforward divide and conquer approaches. Then, we propose a polynomial time, polynomial delay in precise, algorithm based on reverse search. We show the efficiency of our algorithm in practice by computational experiments.