Results 311 to 320 of about 47,591 (350)
Some of the next articles are maybe not open access.
2013
Clubs are generalizations of cliques. For a positive integer s, an s-club in a graph G is a set of vertices that induces a subgraph of G of diameter at most s. The importance and fame of cliques are evident, whereas clubs provide more realistic models for practical applications. Computing an s-club of maximum cardinality is an NP-hard problem for every
Petr A. Golovach +3 more
openaire +1 more source
Clubs are generalizations of cliques. For a positive integer s, an s-club in a graph G is a set of vertices that induces a subgraph of G of diameter at most s. The importance and fame of cliques are evident, whereas clubs provide more realistic models for practical applications. Computing an s-club of maximum cardinality is an NP-hard problem for every
Petr A. Golovach +3 more
openaire +1 more source
The Mathematical Gazette, 1967
In The Gazette for February 1966 (Vol. L, No. 371) Mr. C. A. Parrack introduced cliques to serve as counter-examples for groups. The purpose of this note is to show how cliques are related to groups.
openaire +2 more sources
In The Gazette for February 1966 (Vol. L, No. 371) Mr. C. A. Parrack introduced cliques to serve as counter-examples for groups. The purpose of this note is to show how cliques are related to groups.
openaire +2 more sources
The Mathematical Gazette, 1968
Mr. Parrack's paper on cliques [in the Gazette of February 1966, pp. 43-46] links up with some results which I obtained in 1962 on “ double-identities ”. [Mimeographed copies of the paper are available for any who wish them.] Briefly, the simplest kind of ...
openaire +2 more sources
Mr. Parrack's paper on cliques [in the Gazette of February 1966, pp. 43-46] links up with some results which I obtained in 1962 on “ double-identities ”. [Mimeographed copies of the paper are available for any who wish them.] Briefly, the simplest kind of ...
openaire +2 more sources
Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks
IEEE Transactions on Visualization and Computer Graphics, 2018Complex networks require effective tools and visualizations for their analysis and comparison. Clique communities have been recognized as a powerful concept for describing cohesive structures in networks.
Bastian Alexander Rieck +3 more
semanticscholar +1 more source
ACM SIGAPL APL Quote Quad, 2007
We introduce shape cliques, a simple way to organize a subset of the arrays appearing in an array-language-based application into sets of identically shaped arrays - shape cliques - and show how a compiler can analyze an application to infer membership in those cliques.
openaire +1 more source
We introduce shape cliques, a simple way to organize a subset of the arrays appearing in an array-language-based application into sets of identically shaped arrays - shape cliques - and show how a compiler can analyze an application to infer membership in those cliques.
openaire +1 more source
Australas. J Comb., 1998 A clique polynomial \(C(G,x)\) of a simple graph \(G\) is defined as the polynomial where the coefficient of \(x^i\) is the number of cliques with \(i\) vertices and the constant term is 1. It is proved that this polynomial has always a real root.
Hossein Hajiabolhassan +1 more
openaire +1 more source
A biased random-key genetic algorithm for the maximum quasi-clique problem
European Journal of Operational Research, 2018Given a graph G = ( V , E ) and a threshold γ ∈ (0, 1], the maximum cardinality quasi-clique problem consists in finding a maximum cardinality subset C* of the vertices in V such that the density of the graph induced in G by C* is greater than or equal ...
Bruno Q. Pinto +3 more
semanticscholar +1 more source
Scaling Up k-Clique Densest Subgraph Detection
Proc. ACM Manag. Data, 2023Yizhang He +4 more
semanticscholar +1 more source
1998
The clique operator K maps a graph G into its clique graph, which is the intersection graph of the (maximal) cliques of G. Among all the better studied graph operators, K seems to be the richest one and many questions regarding it remain open. In particular, it is not known whether recognizing a clique graph is in P.
Marisa Gutierrez, João Meidanis
openaire +1 more source
The clique operator K maps a graph G into its clique graph, which is the intersection graph of the (maximal) cliques of G. Among all the better studied graph operators, K seems to be the richest one and many questions regarding it remain open. In particular, it is not known whether recognizing a clique graph is in P.
Marisa Gutierrez, João Meidanis
openaire +1 more source
A review of clique-based overlapping community detection algorithms
Knowledge and Information Systems, 2022S. Gupta +2 more
semanticscholar +1 more source