Results 101 to 110 of about 47,591 (350)
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 +3 more sources
Binary positive semidefinite matrices and associated integer polytopes [PDF]
, 2010 We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes.We begin by establishing some basic properties of these matrices and polytopes.
Sorensen, M M +3 more
core
Journal of Adolescence, EarlyView.ABSTRACT Introduction Adolescence is a period of heightened vulnerability to psychopathology, when capacities for mentalising and interpersonal trust develop rapidly. This study investigated how configurations of reflective functioning (RF) and epistemic trust (ET) differentiate patterns of internalizing and externalizing problems in youth.
Ilaria Maria Antonietta Benzi +5 more
wiley +1 more source
Efficient Algorithms for Subgraph Listing
Algorithms, 2014 Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
doaj +1 more source
An Efficient movie recommendation algorithm based on improved k-clique
Human-Centric Computing and Information Sciences, 2018 The amount of movie has increased to become more congested; therefore, to find a movie what users are looking for through the existing technologies are very hard. For this reason, the users want a system that can suggest the movie requirement to them and
Vilakone Phonexay +3 more
semanticscholar +1 more source
An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem [PDF]
, 2009 Although the lift-and-project operators of Lovász and Schrijver have been the subject of intense study, their M(K, K) operator has received little attention. We consider an application of this operator to the stable set problem.
Rossi, F +3 more
core
On weighted clique graphs [PDF]
, 2022 Let K(G) be the clique graph of a graph G. A m-weighting of K(G) consists on giving to each m-size subset of its vertices a weight equal to the size of the intersection of the m corresponding cliques of G.
Szwarcfiter, Jayme Luiz, Bonomo, Flavia
core
Adolescents' Experiences of Hate Speech and Psychological Needs: A Reflexive Thematic Analysis
Journal of Adolescence, EarlyView.ABSTRACT Introduction Adolescents are increasingly exposed to hate speech in both online and offline contexts, yet limited research has examined how such exposure is experienced and how it relates to adolescents' psychological needs and well‐being. Drawing on Self‐Determination Theory (SDT), this study explores how adolescents make sense of hate speech
Tomas Jungert +6 more
wiley +1 more source
Bounded Confidence under Preferential Flip: A Coupled Dynamics of Structural Balance and Opinions. [PDF]
PLoS ONE, 2016 In this work we study the coupled dynamics of social balance and opinion formation. We propose a model where agents form opinions under bounded confidence, but only considering the opinions of their friends.
Antonio Parravano +2 more
doaj +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, EarlyView.ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source