Results 81 to 90 of about 5,334 (178)

Exact upper bounds for the minimum sizes of strong and weak separating path systems of cliques

19 pages, improved exposition incorporating comments from ...
Kontogeorgiou, George, Stein, Maya
openaire   +2 more sources

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring [PDF]

Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient.
Ruff, Janosch, Skretas, George, Maus, Yannic, Baguley, Samuel   +3 more
core   +1 more source

Strong computational lower bounds via parameterized complexity

, 2006
We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class includes weighted satisfiability, dominating set, hitting set, set cover, clique, and independent set. For example, although a
Chen, Jianer, Iyad A. Kanj, Ge Xia, Kanj, Iyad A., Huang, Xiuzhen, Jianer Chen, Xiuzhen Huang, Xia, Ge   +7 more
core   +1 more source

Dealing with uncertainty and volatility in the port industry network: Social and instrumental antecedents of "clique" survival

, 2014
The recent proliferation of inter-firm collaborative linkages within the container port industry is progressively shaping a complex architecture of voluntary ties among terminal operators, i.e. an inter-organizational network. Within the overall industry
Satta, Giovanni, Giovanni Satta, Caschili, Simone, Francesco Parola, Simone Caschili, PAROLA, Francesco   +5 more
core   +1 more source

Alliance block building and breaking: The role of technological profiles in determining the likelihood of clique spanning ties

, 2008
Clique spanning ties can be expected to have strategic advantages for firms maneuvering themselves in a position as broker between two dense regions of firms.
HAGEDOORN, John, VANHAVERBEKE, Wim, PIETERS, Michiel, Van de Vrande, Vareska   +3 more
core   +1 more source

Prediction of hub genes in pulpal inflammation and regeneration using autoencoders and a generative AI approach

Scientific Reports
Pulpal inflammation and regeneration are crucial for enhancing endodontic treatment outcomes. Transcriptomic studies highlight the involvement of proinflammatory cytokines, NF-κB signaling, and stem cell activity.
Pradeep K. Yadalam, Jogikalmat Krithikadatta, Prabhu M. Natarajan, Carlos M. Ardila   +3 more
doaj   +1 more source

A) Example of a pig fighting network with a high number of aggressive interactions with a six animal clique. B) Example of a network with a lower number of aggressive interactions with a six animal clique.

, 2018
Cliques are highlighted in red for emphasis. Regardless of the difference in the number of interactions in each network, the presence of a clique is a strong predictor of the injuries the pen will have at a later date (3wk-PM).
Rainer Roehe (2147326), Andrea Doeschl-Wilson (256793), Simone Foister (5819807), Gareth Arnott (194296), Simon Turner (1497), Laura Boyle (5819810)   +5 more
core   +1 more source

Valid inequalities and branch-and-cut for the clique pricing problem

, 2011
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation network. We formulate the problem as a linear mixed integer program and propose
Patrice Marcotte, Gilles Savard, Marcotte, Patrice, Heilporn, Géraldine, Martine Labbé, Savard, Gilles, Géraldine Heilporn, Labbé, Martine   +7 more
core   +1 more source

Fixation and extinction in time-fluctuating spatially structured metapopulations

Physical Review Research
Bacteria evolve in volatile environments and complex spatial structures. Migration, fluctuations, and environmental variability therefore have a significant impact on the evolution of microbial populations. Here, we consider a class of spatially explicit
Matthew Asker, Mohamed Swailem, Uwe C. Täuber, Mauro Mobilia   +3 more
doaj   +1 more source

Solving Difficult SAT Instances Using Greedy Clique Decomposition. Accepted to

, 2007
. We are dealing with solving difficult SAT instances in this paper. We propose a method for preprocessing SAT instances (CNF formulas) by using consistency techniques known from constraint programming methodology and by using our own consistency ...
Pavel Surynek
core