Results 261 to 270 of about 34,680 (295)
Some of the next articles are maybe not open access.
Improved Algorithms for Maximal Clique Search in Uncertain Networks
IEEE International Conference on Data Engineering, 2019Enumerating maximal cliques from an uncertain graph is a fundamental problem in uncertain graph analysis. Given an uncertain graph G, a set of nodes C in G is a maximal (k, τ)-clique if (1) |C|>k and C is a clique with probability at least τ, and (2) C ...
Ronghua Li +5 more
semanticscholar +1 more source
ACM SIGACCESS Accessibility and Computing, 2006
The purpose of the Clique project is to explore a new way of adapting applications with graphical user interfaces (GUIs) for use in audio. Existing adaptation methods retain the components and metaphors of visual interfaces in the audio displays they produce.
openaire +1 more source
The purpose of the Clique project is to explore a new way of adapting applications with graphical user interfaces (GUIs) for use in audio. Existing adaptation methods retain the components and metaphors of visual interfaces in the audio displays they produce.
openaire +1 more source
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
The Mathematical Gazette, 1966
The clique originated from a search for a counter-example for the group, and this may be thought a sufficient justification for its study However, as well as its behaviour frequently being similar to that of the group, it has a number of properties which are peculiarly its own.
openaire +2 more sources
The clique originated from a search for a counter-example for the group, and this may be thought a sufficient justification for its study However, as well as its behaviour frequently being similar to that of the group, it has a number of properties which are peculiarly its own.
openaire +2 more sources
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
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
A review of clique-based overlapping community detection algorithms
Knowledge and Information Systems, 2022S. Gupta +2 more
semanticscholar +1 more source
Cliques and fuzzy cliques in fuzzy graphs
Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569), 2002The authors define the concept of a fuzzy clique. In the case of a fuzzy graph, the concept of a cycle and a fuzzy cycle has been studied. The aim of the paper is to present the concept of a clique and a fuzzy clique in fuzzy graphs, consistent with the definition of cycles and fuzzy cycles in fuzzy graphs.
P.S. Nair, S.-C. Cheng
openaire +1 more source
Cliques and clique covers in fuzzy graphs
Journal of Intelligent & Fuzzy Systems, 2016This paper deals with fuzzy clique covers in fuzzy graphs. The definition of a fuzzy clique is modified so that the fuzzy subgraph induced by each fuzzy clique is complete. Then, fuzzy cliques and maximal fuzzy cliques are characterized. Finally, fuzzy clique covers and minimum fuzzy clique covers in fuzzy graphs are introduced and characterized, and ...
Sun, Feng, Wang, Xue-Ping, Qu, Xiao-Bing
openaire +2 more sources