Results 51 to 60 of about 3,915 (163)
Relating threshold tolerance graphs to other graph classes [PDF]
, 2014 A graph G=(V, E) is a threshold tolerance if it is possible to associate weights and tolerances with each node of G so that two nodes are adjacent exactly when the sum of their weights exceeds either one of their tolerances.
CALAMONERI, Tiziana, SINAIMERI, BLERINA
core +1 more source
Advanced Science, EarlyView.In ankylosing spondylitis (AS), mechanical strain‐programmed SDC1+ sheath fibroblasts secrete CXCL5 to recruit neutrophils and promote the activation of CXCR4hi neutrophils, thereby exacerbating enthesitis by promoting neutrophil extracellular traps (NETs) formation. SOX5 controls the generation of SDC1+ sheath fibroblasts via super‐enhancers.
Jiajie Lin +13 more
wiley +1 more source
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Figueiredo, C.M.H. +3 more
openaire +2 more sources
Energy Science &Engineering, EarlyView.This paper aims to provide a robust design approach for HAWTs operating in shear flow. This study fills a critical research gap by integrating BEM and vortex theories for blade design in non‐homogeneous inflow conditions. The authors of the paper made an effort to develop and test an experimentally unsophisticated model of a turbine working in shear ...
Agnieszka Dorota Woźniak +2 more
wiley +1 more source
An Algorithm for Generating Strongly Chordal Graphs
, 2018 Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not aware of any algorithm that can generate instances of this class, often necessary for testing purposes.
Rahman, Md. Zamilur +2 more
openaire +2 more sources
The parallel solution of domination problems on chordal and strongly chordal graphs
Discrete Applied Mathematics, 1994 This paper discusses the problem of the existence of a dominating clique in a chordal graph. The equivalence of the dominating set problem and the minimum dominating clique problem for strongly chordal graphs has also been proved. Further, it has been proved that both problems are equivalent to the cover problem viz.
Dahlhaus, Elias, Damaschke, Peter
openaire +1 more source
iMetaOmics, EarlyView.First use of a natural swine model with lipid metabolism to directly link lipid differences to a quantifiable intestinal villus height phenotype. Identified the phospholipid‐derived oleoylethanolamide, rather than canonical fatty acids, as the endogenous primary ligand that activates peroxisome proliferator‐activated receptors α (PPARα) to enlarge ...
Qianqian Wang +9 more
wiley +1 more source
Journal of Periodontology, EarlyView.Abstract Background To examine whether the associations between periodontitis and multiple systemic conditions increase with increasing severity of periodontitis using a multi‐center electronic health record (EHR) repository. Methods A cross‐sectional analysis was conducted using EHR data from 9 dental schools in the United States.
Muhammad H. A. Saleh, Hamoun Sabri
wiley +1 more source
On Strongly Chordal Graphs That Are Not Leaf Powers [PDF]
, 2017 A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv is an edge if and only if the distance between u and v in T is at most k.
openaire +2 more sources
PLANTS, PEOPLE, PLANET, EarlyView.Arboreta bridge people and nature while conserving tree biodiversity, supporting climate resilience, and advancing environmental education. This study maps over a century of available and indexed arboretum research, uncovering trends, knowledge gaps, and opportunities for collaboration.
Catarina Patoilo Teixeira +1 more
wiley +1 more source