Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23--28 (1965) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Recasting Program Reverse Engineering through On-Line Analytical .. - Andritsos (2000) (Correct)
....a graph in which each pair of vertices is an edge. A complete graph ( a graph in which all pairs of vertices form edges) has many subgraphs that are not cliques, but every induced subgraph of a complete graph is a clique [Wes96] Finding cliques, however, is an NP complete problem [CW78] and in [MM65] Moon and Moser showed that the number of cliques in a graph may grow exponentially with the number of nodes. In our work, we do not consider any graph theoretical algorithm.An interesting question that arises when a clustering algorithm is applied, has to do with the identity of the clusters. ....
J. W. Moon and L. Moser. On cliques in graphs. Israel Journal of Mathematics, 3:23--28, 1965.
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993) (9 citations) (Correct)
....j 2 ) is in E iff i 1 6= i 2 . Let normalize(x) ff(x) hY 1 ; Y p i (Y k s are sets) Then it follows from the definition of ff that Y 1 ; Y p are precisely the cliques of G. Since n = size x = jXj, applying the upper bound on the number of cliques for a graph with n vertices [28], we obtain p = m(x) 3 p 3 n . Case 4. x = hX 1 ; X k i where X i s are or sets of a base type. Then normalize(x) or (x) and m(x) n. Again, simple arithmetic shows that n 3 p 3 n . Hence, m(x) 3 p 3 n . The proof of the general case is very similar to the proof of ....
J. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics 3 (1965), 23--28.
The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999) (30 citations) (Correct)
....of graph G. This is an improvement over the time complexity in [311] Finally, Tomita et al. 310] proposed a modified Bron and Kerbosch [73] algorithm and claimed its time complexity to be O(3 n=3 ) As they pointed out, this was the best one could hope for since the Moon and Moser graphs [238] have 3 n=3 maximal cliques. 5.2 Exact Algorithms for the Unweighted Case If our goal is to find a maximum clique or just the size of a maximum clique, a lot of work can be saved from the above enumerative algorithms. Because once we find a clique, we only need to enumerate cliques better than ....
J.W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, Vol. 3: 23-28, 1965.
B. Balasundaram - Butenko Hicks Sachdeva (Correct)
No context found.
Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23--28 (1965)
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993) (9 citations) (Correct)
No context found.
J. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics 3 (1965), 23--28.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC