Results 151 to 160 of about 5,334 (178)
SGLT2 Inhibition as a Perioperative Cardiorenal Stabilizer in Cardiac Surgery: Integrated Clinical Cohort and Pleiotropic Network-Based Pharmacological Analysis. [PDF]
J Clin MedOnar LC, Guner E, Yilmaz I.
europepmc +1 more source
Leveraging graphical model techniques to study evolution on phylogenetic networks. [PDF]
Philos Trans R Soc Lond B Biol SciTeo B, Bastide P, Ané C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The strong clique index of a graph with forbidden cycles
Journal of Graph Theory, 2021AbstractGiven a graph , the strong clique index of , denoted , is the maximum size of a set of edges such that every pair of edges in has distance at most 2 in the line graph of . As a relaxation of the renowned Erdős–Nešetřil conjecture regarding the strong chromatic index, Faudree et al.
Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim
exaly +2 more sources
Strong clique trees, neighborhood trees, and strongly chordal graphs
Journal of Graph Theory, 2000A graph is a strongly chordal graph, if it is chordal and every cycle of even length at least six has a chord that divides the cycle into two odd-length paths. Whereas maximal complete subgraphs and clique trees are central objects in the theory of chordal grahps, a simple notion of strong clique trees allows to extend this structure to strongly ...
Terry A Mckee
exaly +3 more sources
A strong Nash stability based approach to minimum quasi clique partitioning
2014 Sixth International Conference on Communication Systems and Networks (COMSNETS), 2014The problem of network partitioning into cohesive subgroups is of utmost interest in analysis of social networks. In this paper we use quasi clique based partitioning to study social cohesion. We propose a greedy algorithm based on the notion of strong Nash stability to determine the cohesive subgroups in a network. Through experimental results we show
Debarka Sengupta +2 more
exaly +2 more sources
Community recommendation in social network using strong friends and quasi-clique approach
8th International Conference on Electrical and Computer Engineering, 2014A social networking service is a platform to build relations among people who share interests, activities, backgrounds or real-life connections. Communities in a social network are the gathering places for the people with common interest. Social network analysis is in high demand now a days for the increasing number of users.
Anjum Ibna Matin +2 more
exaly +2 more sources
A Transformation Which Preserves the Clique Number
Journal of Combinatorial Theory Series B, 2001 We introduce a graph transformation which preserves the clique number. When applied to graphs containing no odd hole and no cricket (a particular graph on 5 vertices) the transformation also preserves the chromatic number.
Michael U Gerber, Alain Hertz
exaly +2 more sources
$t$-Strong Cliques and the Degree-Diameter Problem
SIAM Journal on Discrete Mathematics, 2021Summary: For a graph \(G\), \(L(G)^t\) is the \(t\)-th power of the line graph of \(G\) -- that is, vertices of \(L(G)^t\) are edges of \(G\) and two edges \(e, f\in E(G)\) are adjacent in \(L(G)^t\) if \(G\) contains a path with at most \(t\) vertices that starts in a vertex of \(e\) and ends in a vertex of \(f\).
Michal Debski +1 more
openaire +2 more sources
A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components
CoRR, 2013 We propose a fast, parallel, maximum clique algorithm for large, sparse graphs that is designed to exploit characteristics of social and information networks.
Ryan A. Rossi +3 more
openaire +2 more sources