Approximating the independence number via the j -function
Mathematical Programming: Series A and B
Finding a large hidden clique in a random graph
proceedings of the eighth international conference on Random structures and algorithms
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
Approximating Maximum Clique by Removing Subgraphs
SIAM Journal on Discrete Mathematics
A spectral heuristic for bisecting random graphs
Random Structures & Algorithms
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Coloring Random Intersection Graphs and Complex Networks
SIAM Journal on Discrete Mathematics
Finding Planted Partitions in Random Graphs with General Degree Distributions
SIAM Journal on Discrete Mathematics
Equivalence of a random intersection graph and G(n,p)
Random Structures & Algorithms
On the independence number and Hamiltonicity of uniform random intersection graphs
Theoretical Computer Science
Communication and security in random intersection graphs models
WOWMOM '11 Proceedings of the 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks
A guided tour in random intersection graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
In this paper, we relate the problem of finding a maximum clique to the intersection number of the input graph (i.e. the minimum number of cliques needed to edge cover the graph). In particular, we consider the maximum clique problem for graphs with small intersection number and random intersection graphs (a model in which each one of m labels is chosen independently with probability p by each one of n vertices, and there are edges between any vertices with overlaps in the labels chosen). We first present a simple algorithm which, on input G finds a maximum clique in $O(2^{2^m + O(m)} + n^2 \min\{2^m, n\})$ time steps, where m is an upper bound on the intersection number and n is the number of vertices. Consequently, when m≤ln ln n the running time of this algorithm is polynomial. We then consider random instances of the random intersection graphs model as input graphs. As our main contribution, we prove that, when the number of labels is not too large (m=nα, 0α As an important consequence of our Single Label Clique Theorem, we prove that the problem of inferring the complete information of label choices for each vertex from the resulting random intersection graph (i.e. the label representation of the graph) is solvable whp; namely, the maximum likelihood estimation method will provide a unique solution (up to permutations of the labels). Finding efficient algorithms for constructing such a label representation is left as an interesting open problem for future research.