Results 31 to 40 of about 444 (188)
An Algorithm for Generating Strongly Chordal Graphs
CoRR, 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.
Md. Zamilur Rahman +2 more
openaire +2 more sources
Dualizing chordal graphs [PDF]
, 2003 Although chordal graphs may seem at first to be a poor choice to approach using cycle/cutset graph duality, portions of chordal graph theory can be successfully dualized within the context of nonseparable 3-edge-connected graphs.
McKee, Terry A.
core +1 more source
Arthritis Care &Research, EarlyView.Objective Frailty occurs prematurely in rheumatoid arthritis (RA) and is associated with poor health outcomes. We compared the performance of four frailty instruments, including a pragmatic alternative measure using chair sit‐to‐stand (STS), and evaluated their abilities to predict poor health outcomes.
Kylie E. Riggles +14 more
wiley +1 more source
Chordal bipartite completion of colored graphs [PDF]
, 2007 Golumbic, Kaplan, and Shamir [Graph sandwich problems, J. Algorithms 19 (1995) 449–473], in their paper on graph sandwich problems published in 1995, left the status of the sandwich problems for strongly chordal graphs and chordal bipartite graphs open ...
R. Sritharan, Sritharan, R.
core +1 more source
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs [PDF]
, 2023 International audienceFor a graph G=(V,E) with a vertex set V and an edge set E, a function f:V→{0,1,2,...,diam(G)} is called a broadcast on G. For each vertex u∈V, if there exists a vertex v in G (possibly, u=v) such that f(v)>0 and d(u,v)≤f(v), then f ...
Islam, Sk Samim +3 more
core +1 more source
Advanced Healthcare Materials, EarlyView.We developed a patient‐derived, functional microfluidic model of the diffuse midline glioma (DMG) blood–brain–tumor barrier (BBTB) comprised of endothelial cells, astrocytes, pericytes, and tumor cells. The system forms perfusable microvasculature, reveals the BBTB retains vascular integrity, identifies DMG‐specific transcriptomic changes distinct from
Kimberly R. Bennett +7 more
wiley +1 more source
In Situ Change in Contact Angle of a Sessile Droplet on a Magnetoactive Elastomer
Advanced Materials Interfaces, EarlyView.Contact angles of persistent μL$\mu{\rm L}$‐sized water droplets on a mechanically soft MAE surface under time varying magnetic fields differ from those of newly deposited droplets. The ability to quickly alter the material properties allows one to observe intriguing droplet‐material interactions.
Raphael Kriegl +3 more
wiley +1 more source
New proofs for strongly chordal graphs and chordal bipartite graphs [PDF]
, 2004 We give new proofs of well-known characterizations of strongly chordal graphs and chordal bipartite graphs. The key ingredient is the dual hypertree structure for totally balanced hypergraphs.
Jacent Tokaz +2 more
core
Regular vines with strongly chordal pattern of (conditional) independence [PDF]
, 2022 Multivariate statistical models can be simplified by assuming that a pattern of conditional independence is presented in the given data. A popular way of capturing the (conditional) independence is to use probabilistic graphical models.
Zhu, K. (author) +3 more
core +1 more source
Decoding Spatial Heterogeneity and Multi‐Omics Regulation with Hierarchical Graph Learning
Advanced Science, EarlyView.ABSTRACT Recent advances in spatial multi‐omics technologies have enabled the simultaneous profiling of multiple molecular layers within the same tissue slice, providing unprecedented opportunities to investigate tissue spatial organization. However, most existing computational methods identify spatial domains in a purely data‐driven manner, rarely ...
Jiazhou Chen +6 more
wiley +1 more source