Results 141 to 150 of about 47,591 (350)
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs [PDF]
, 2019 Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is
Faria, L. +3 more
core
On second iterated clique graphs that are also third iterated clique graphs [PDF]
, 2015 Iterated clique graphs arise when the clique operator is applied to a graph more than once. Determining whether a graph is a clique graph or an iterated clique graph is usually a difficult task.
de Caria, Pablo Jesús +1 more
core +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, EarlyView.ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
Broadcasting in Stars of Cliques and Path-Connected Cliques
AlgorithmsBroadcasting is a fundamental information dissemination problem in a connected network where one node, referred to as the originator, must distribute a message to all other nodes through a series of calls along the network’s links. Once informed, nodes assist the originator by forwarding the message to their neighbors.
Akash Ambashankar +1 more
openaire +2 more sources
Disrupting the Chain of Displaced Aggression: A Review and Agenda for Future Research
Journal of Organizational Behavior, EarlyView.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
Clique roots of K4-free chordal graphs
Electronic Journal of Graph Theory and Applications, 2019 The clique polynomial C(G, x) of a finite, simple and undirected graph G = (V, E) is defined as the ordinary generating function of the number of complete subgraphs of G. A real root of C(G, x) is called a clique root of the graph G.
Hossein Teimoori Faal
doaj +1 more source
Journal of Organizational Behavior, EarlyView.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
Journal of Organizational Behavior, EarlyView.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
An optimization algorithm for maximum quasi-clique problem based on information feedback model [PDF]
PeerJ Computer ScienceThe 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
Rational Exponents for Cliques
SIAM Journal on Discrete Mathematics28 pages, 8 ...
Sean English +2 more
openaire +2 more sources