Results 21 to 30 of about 34,680 (295)
Convolutional Neural Networks with Alternately Updated Clique [PDF]
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018 Improving information flow in deep networks helps to ease the training difficulties and utilize parameters more efficiently. Here we propose a new convolutional neural network architecture with alternately updated clique (CliqueNet). In contrast to prior
Yibo Yang +3 more
semanticscholar +1 more source
Clique Partitions and Clique Coverings
Discrete Mathematics, 1988 Only undirected graphs without loops or multiple edges are considered here. \(K_n\) is a clique on \(n\) vertices. The clique covering number and the clique partition number of the graph \(G\) is denoted by \(cc(G)\) and \(cp(G)\)respectively. The authors obtain asymptotic results for \(cp(K_n-K_m)\) for m in the range \(\sqrt{n}
Erd'́os, Paul +2 more
openaire +2 more sources
Quantum Clique Gossiping [PDF]
Scientific Reports, 2018 AbstractThis paper establishes a framework of quantum clique gossiping by introducing local clique operations to networks of interconnected qubits. Cliques are local structures in complex networks being complete subgraphs, which can be used to accelerate classical gossip algorithms.
Bo Li +3 more
openaire +3 more sources
Inverse Clique Domination in Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph induced by S is complete. A clique S in G is a clique dominating set if it is a dominating set.
Carmelita Loquias +2 more
doaj +1 more source
On Several Parameters of Super Line Graph
Axioms, 2023 The super line graph of index r, denoted by Lr(G), is defined for any graph G with at least r edges. Its vertices are the sets of r edges of G, and two such sets are adjacent if an edge of one is adjacent to an edge of the other.
Jiawei Meng +2 more
doaj +1 more source
Online Clique Clustering [PDF]
Algorithmica, 2019 Abstract Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be ...
Chrobak, Marek +3 more
openaire +6 more sources
Scientific Reports, 2016 AbstractHigh-diversity species assemblages are very common in nature, and yet the factors allowing for the maintenance of biodiversity remain obscure. The competitive exclusion principle and May’s complexity-diversity puzzle both suggest that a community can support only a small number of species, turning the spotlight on the dynamics of local patches ...
Yael Fried +2 more
openaire +3 more sources
Efficient Maximal Balanced Clique Enumeration in Signed Networks
The Web Conference, 2020 Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks.
Zi Chen +4 more
semanticscholar +1 more source
PREDICTORS OF ADOLESCENT INVOLVEMENT IN CLIQUES AND GANGS
Anthropological Researches and Studies, 2021 Objectives. The gangs came to the attention of the authorities because of the criminal nature of some of them. To understand which are the appropriate measures to prevent and reduce gang delinquency, this paper aimed at identifying the predictors of ...
Flavia-Elena CIURBEA +2 more
doaj +1 more source
Complex Hadamard graphs and Butson matrices
AKCE International Journal of Graphs and Combinatorics, 2023 This article introduces complex Hadamard graphs and studies their properties. Using the complete subgraphs of these complex Hadamard graphs, complex Hadamard matrices of order n are generated, where n is a multiple of four.
Briji Jacob Chathely, Rajendra P. Deore
doaj +1 more source