Results 71 to 80 of about 3,915 (163)
Feedback vertex set on chordal bipartite graphs [PDF]
Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V such that G-F is a forest.
Kloks, Ton +2 more
core
Abstract Informed by the information‐deficit model, this preregistered survey experiment based on a random sampling of the Dutch population register (n = 2792) assesses how exposure to information about ethnic discrimination inspires adult belief change, especially how it affects (a) perceptions of ethnic inequality, (b) meritocratic explanations of ...
Jonathan Mijs +3 more
wiley +1 more source
Isoperimetric inequalities on slabs with applications to cubes and Gaussian slabs
Abstract We study isoperimetric inequalities on “slabs”, namely weighted Riemannian manifolds obtained as the product of the uniform measure on a finite length interval with a codimension‐one base. As our two main applications, we consider the case when the base is the flat torus R2/2Z2$\mathbb {R}^2 / 2 \mathbb {Z}^2$ and the standard Gaussian measure
Emanuel Milman
wiley +1 more source
Leaf Length Predicts Twig Xylem Vessel Diameter Across Angiosperms
ABSTRACT As plants grow taller, increasing conductive pathlength imposes hydraulic resistance, challenging the maintenance of water transport to leaves. While tip‐to‐base conduit widening along the stem helps mitigate this resistance, theoretical models and empirical data suggest that stem widening alone is insufficient to fully compensate.
Patricia Rivera +2 more
wiley +1 more source
A human cell‐based microphysiological system integrates engineered muscle tissues with an inflamed adipose–macrophage niche to model obese microenvironment‐induced muscle dysfunction. Muscle contraction is quantified by pillar deflection coupled with computational stiffness estimation. Secretome and transcriptomic profiling reveal inflammation‐mediated
Seunggyu Kim +16 more
wiley +1 more source
Finding Dominating Cliques Efficiently, in Strongly Chordal Graphs and Undirected Path Graphs
A set of vertices in a graph is called a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating clique is a dominating set that induces a complete subgraph. The problem of locating a dominating clique of minimum cardinality is known to be NP-complete for general chordal graphs.
openaire +1 more source
Characterizing and computing the structure of clique intersections in strongly chordal graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nevries, Ragnar, Rosenke, Christian
openaire +1 more source
Herein, a systematic digital twin workflow tailored for generating high‐fidelity virtual representations of anisotropic composite microstructures and giga‐voxel meso‐structural models is presented, leveraging a harmonious integration of top–down image‐based modeling and bottom–up data‐driven voxel generation.
Siwon Yu +7 more
wiley +1 more source
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
A spanning tree \(T\) of a graph \(G=(V,E)\) is locally connected if for all \(v \in V\) the subgraph of \(G\) induced by \(N_T(v)\) is connected. \textit{L. Cai} [Discrete Appl. Math. 131, 63--75 (2003; Zbl 1022.05079)] showed that it is NP-complete to decide whether a graph has a locally connected spanning tree.
Lin, C. C., Chang, G. J., Chen, G. H.
openaire +2 more sources
In this study, scRNA‐seq and chemoproteomics are integrated to characterize CDDP‐bound proteins at single‐cell resolution in tumor‐bearing mice. Additionally, the research demonstrates that ICA alleviates CDDP‐induced nephrotoxicity while enhancing its chemotherapeutic efficacy.
Piao Luo +19 more
wiley +1 more source

