Results 81 to 90 of about 135,666 (285)
European Journal of Social Psychology, EarlyView.ABSTRACT Affective polarisation, a growing hostility toward political outgroups, is a phenomenon rooted in social identity. Social identity threat—the expectation of experiencing some form of denigration based on a self‐relevant group identity—is thought to be a major driver of affective polarisation.
Brandon McMurtrie +4 more
wiley +1 more source
A Tutorial on Clique Problems in Communications and Signal Processing
, 2020 Since its first use by Euler on the problem of the seven bridges of K\"onigsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems.
Al-Naffouri, Tareq Y. +3 more
core
Operads of decorated cliques II: Noncrossing cliques
, 2023 A complete study of an operad $\mathrm{NC} \mathcal{M}$ of noncrossing configurations of chords introduced in previous work of the author is performed. This operad is defined on the linear span of all noncrossing $\mathcal{M}$-cliques. These are noncrossing configurations of chords with arcs labeled by a unitary magma $\mathcal{M}$.
openaire +2 more sources
Exploration, EarlyView.The role of cuproptosis in HBV‐ALF was explored via bioinformatics and liver biopsy tissues. There are some crosstalks among cuproptosis, immune infiltration, and ferroptosis (The figure was created by Bio Render). ABSTRACT Hepatitis B virus (HBV) infection poses a significant challenge to global health, particularly in developing countries such as ...
Jingwen Deng +10 more
wiley +1 more source
Cliques of Graph Convolutional Networks for Recommendation
IEEE AccessGraph neural networks have become a popular technique for collaborative filtering. However, most related work is based on user-item bipartite graphs, which can generate a large amount of noise due to the broad and elusive interests of users.
Zhenye Pan, Yahong Chen
doaj +1 more source
Parallel Maximum Clique Algorithms with Applications to Network Analysis and Storage [PDF]
, 2013 We propose a fast, parallel maximum clique algorithm for large sparse graphs that is designed to exploit characteristics of social and information networks.
Ali Patwary +4 more
core
Clique Graphs and Edge-clique graphs
Electronic Notes in Discrete Mathematics, 2003 AbstractNot every edge-clique graph is a clique graph. 1 IntroductionLet Gbe a graph. The clique graph of G, K(G), is the intersection graph of thefamily of all maximal cliques of G. The edge-clique graph of G, K e (G), is theone whose vertices are the edges of G, two vertices being adjacent in K e (G),when the corresponding edges of G belong to a same
openaire +1 more source
Future in Educational Research, EarlyView.ABSTRACT Recognising the importance of addressing teacher development in the early career stages, our study examined programmatic considerations within teacher education programmes in Canada to determine the extent to which teacher preparation included support for and promotion of teacher well‐being as part of their pre‐service teaching development ...
Benjamin Kutsyuruba +6 more
wiley +1 more source
New Reality – New Problems. Financial Crime in Greater Poland in the Years 1945-1970
Studia Historiae Oeconomicae, 2017 Systemic transformation in Poland after the Second World War led to deep transformations within the economy. It did not, however, change the way people thought.
Stanisław Jankowiak
doaj +1 more source
Clique coloring $B_1$-EPG graphs
, 2017 We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are $2$-clique colorable.
Bonomo, Flavia +2 more
core