Results 111 to 120 of about 135,666 (285)
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová +3 more
wiley +1 more source
Disrupting the Chain of Displaced Aggression: A Review and Agenda for Future Research
ABSTRACT Displaced aggression refers to instances in which a person redirects their harm‐doing behavior from a primary to a secondary, substitute target. Since the publication of the first empirical article in 1948, there has been a noticeable surge in research referencing this theory in both management and psychology journals.
Constantin Lagios +4 more
wiley +1 more source
An optimization algorithm for maximum quasi-clique problem based on information feedback model [PDF]
The maximum clique problem in graph theory is a well-known challenge that involves identifying the complete subgraph with the highest number of nodes in a given graph, which is a problem that is hard for nondeterministic polynomial time (NP-hard problem).
Shuhong Liu +4 more
doaj +2 more sources
Maximizing Cliques in Shellable Clique Complexes
In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur n's famous theorem. We consider the implications of the connectivity property of simplicial complexes known as shellability on clique complexes associated with graphs.
openaire +2 more sources
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
We study finding and listing $k$-cliques in a graph, for constant $k\geq 3$, a fundamental problem of both theoretical and practical importance. Our main contribution is a new output-sensitive algorithm for listing $k$-cliques in graphs, for arbitrary $k\geq 3$, coupled with lower bounds based on standard fine-grained assumptions, showing that our ...
Mina Dalirrooyfard +3 more
openaire +2 more sources
ABSTRACT Subgroups are dynamic entities evolving constantly in response to changing contexts and time. Although scholars from both the attribute and the network views have acknowledged that subgroups are inherently complex and fluid, research in these traditions has remained bifurcated, with limited efforts to integrate the two perspectives to more ...
Jinhee Moon +3 more
wiley +1 more source
In the $K_r$-Cover problem, given a graph $G$ and an integer $k$ one has to decide if there exists a set of at most $k$ vertices whose removal destroys all $r$-cliques of $G$. In this paper we give an algorithm for $K_r$-Cover that runs in subexponential FPT time on graph classes satisfying two simple conditions related to cliques and treewidth.
Berthe, Gaétan +3 more
openaire +5 more sources
ABSTRACT People with disabilities (PWD) often face barriers to inclusion at work. To tackle this challenge, past research focused on the role of organizations to create more inclusive workplaces. What remains understudied, however, is the role that PWD often take themselves in shaping their inclusion experiences.
Louisa Antonia Riess +2 more
wiley +1 more source
ABSTRACT The relationship between team composition and organizational outcomes is a critical topic in many managerial and business contexts. In this study, we utilize an experimental research method to examine the impact of cognitive diversity on team dynamics.
Jantunen Ari +5 more
wiley +1 more source
Clique-to-Clique Monophonic Distance in Graphs
It is shown that the clique-to-clique monophonic center a connected graph does not lie in a single block of G.
I. Keerthi Asir, S. Athisayanathan
openaire +1 more source

