Results 141 to 150 of about 655,680 (212)
On the hyperbolicity of edge-chordal and path-chordal graphs
If X is a geodesic metric space and x1, x2, x3 ( X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
José Rodríguez +3 more
core +1 more source
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov +3 more
wiley +1 more source
Abstract The 1430s were characterized by extreme weather conditions, food and fodder shortages, and high mortalities among animals and humans, although the severity of events and their consequences in England have received limited attention. The economic downturn and the depressed customary land market in this decade marked the beginning of the Great ...
Mark Bailey
wiley +1 more source
Dual Host–Pathogen Screening of the Lung During Severe Influenza Using Spatial Transcriptomics
We performed genome‐wide spatial transcriptomics at 10 μm resolution on the lungs of mice infected with influenza A virus. We utilised publicly available scRNAseq reference datasets to identify cell types present. We found viral transcripts across all detected cell types, suggesting localised indiscriminate infection.
Marcus Z. W. Tong +9 more
wiley +1 more source
Plcg2 Deficiency Leads to Sex‐Associated Divergent Effects on Glial Transcriptomes
Plcg2 shapes glial programs linked to neurodegenerative disease–associated pathways in young, pathology‐free brains. Microglia and astrocytes exhibit sex‐opposing transcriptomic changes to Plcg2 deficiency. ABSTRACT Plcg2 encodes an intracellular phospholipase C signaling enzyme expressed predominately in microglia in the brain. Genome‐wide association
Kelly A. Hartigan +9 more
wiley +1 more source
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Partitioning a planar graph without chordal 5-cycles into two forests
summary:It was known that the vertex set of every planar graph can be partitioned into three forests. We prove that the vertex set of a planar graph without chordal 5-cycles can be partitioned into two forests.
Wang, Yang +3 more
core +1 more source
Bipartite Powers of k-chordal Graphs
Let k be an integer and k ≥ 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs.
Chandran, Sunil, L. +3 more
core +1 more source
Bottom‐up and top‐down problem solving with agentic AI
Abstract Agentic LLM agents can sometimes seem like magic, granting our (almost) every wish. But like the magic genies in stories like the Sorcerer's Apprentice, sometimes you have to be careful what you wish for. The difficulty of precisely specifying what it is we want and unintended consequences, sometimes derail this magic.
Henry Lieberman, David Canfield Smith
wiley +1 more source
Chordal Bipartite Graphs with High Boxicity
The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4.
Chandran, Sunil L +2 more
core

