Tag: clique


Found 42 results for 'clique'.


1) graph-theory - Clique graph of bipartite graphs
2) cc.complexity-theory - Hardness of parameterized CLIQUE?
3) reference-request - Graph classes in which CLIQUE is known to be NP-hard?
4) reference-request - Tree-decomposition with clique interfaces
5) np-hardness - $k$-clique in $k$-partite graph
6) reference-request - The number of cliques in a graph: the Moon and Moser 1965 result
7) reference-request - Number of maximal cliques in a ($2C_4$, $C_5$, $P_5$)-free graph
8) cc.complexity-theory - Improving Cook's generic reduction for Clique to SAT?
9) graph-theory - Reasons for which a graph may be not $k$ colorable?
10) cc.complexity-theory - 2FA state complexity of k-Clique?
11) graph-theory - Algorithms for online clique detection
12) ds.algorithms - M-clique covers in complete graphs
13) ds.algorithms - Dividing a complete graph into two cliques with maximal sum of edge weights
14) graph-theory - Minimal clique edge cover vs minimalist (assignment-minimum) ones
15) cc.complexity-theory - Polynomial-time distinguishability threshold of planted clique
16) cc.complexity-theory - Algorithms and computational complexity of clique and biclique covers
17) approximation-hardness - Hardest problems to approximate
18) co.combinatorics - Computing the union closure
19) ds.algorithms - Heuristics for the minimum-weight $k$-clique problem
20) graph-algorithms - Clique-Percolation Algorithm's "corner cases"
21) cc.complexity-theory - 3-Clique Partition for graphs of fixed diameter
22) graph-algorithms - How to approximate minimum clique edge cover
23) cc.complexity-theory - Hardness of $k$-Plex
24) ds.algorithms - Finding cliques in a big graph
25) graph-theory - Counting the number of K4
26) graph-theory - Given a 4-cycle free graph $G$, can we determine if it has a 3-cycle in quadratic time?
27) co.combinatorics - Worst case ratio between minimum clique cover and maximum independent set
28) ds.algorithms - Clique Enumeration Algorithm
29) graph-theory - Decomposing complete graphs into clique-free graphs of certain size
30) graph-theory - Will core decomposition get a maximal clique?
31) graph-theory - Minimal polynomial reduction of dominating set to max clique
32) clique - Maximal Clique partition of vertices with smallest number of cut edges
33) cc.complexity-theory - Comparison between the maximum clique and maximum biclique problem
34) cc.complexity-theory - On Zero sum perfect matching
35) cc.complexity-theory - Separating 2-SAT from Clique
36) cc.complexity-theory - Complexity of k-clique for hypergraphs
37) cc.complexity-theory - Paritioning a graph into clique and independent set
38) cc.complexity-theory - Reference Request: complexity results on finding $(1+\epsilon) \log n$ size clique in $G(n,1/2)$
39) graph-theory - Fast approximation of (vertex) clique cover
40) cc.complexity-theory - Is counting maximal cliques in an incomparability graph #P-complete?
41) graph-theory - Terminology for complete k-partite graph where k is not fixed
42) ds.algorithms - Maximum clique algorithm on undirected graph