Results 111 to 120 of about 916,150 (184)

On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles

Random Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz, Lyuben Lichev, Alexandra Wesolek   +2 more
wiley   +1 more source

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer. [PDF]

Algorithms Mol Biol
Feng DW, El-Kebir M.
europepmc   +1 more source

PolarEyes with enhanced digital imaging, a high‐throughput solution for locating and grading crystals

Journal of Applied Crystallography, Volume 59, Issue 5, Page 1557-1569, October 2026.
An open‐source program for the calculation and visualization of polarization‐derived properties of crystalline material is described, alongside the integration of a polarizing image sensor into a home‐built high‐throughput imaging setup.The long‐range internal order of crystals enables them to exhibit a well known and long‐exploited phenomenon ...
Thomas D. Smith, Alexandra Longcake, Michael J. Hall, Michael R. Probert   +3 more
wiley   +1 more source

Optimizing Context and Cost in LLM‐Based Unit Test Generation: A Study on External Dependency Retrieval Strategies

Expert Systems, Volume 43, Issue 10, October 2026.
ABSTRACT While Large Language Models (LLMs) have demonstrated remarkable capabilities in code generation, their effectiveness in unit testing is often constrained by insufficient context regarding external dependencies. This limitation is particularly pronounced in industrial settings, where proprietary code remains opaque to the model. To address this
Javier Ferrer, Francisco Chicano
wiley   +1 more source

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks. [PDF]

J Chem Theory Comput
Golnik R, Gatter T, Stadler PF, Vassena N.   +3 more
europepmc   +1 more source

Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract It is well‐known that polynomial versions of theorems of Rödl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erdős–Hajnal conjecture. In this note, we prove that these three conjectures are in fact equivalent, extending several previous particular results in this direction by Fox, Nguyen ...
Matija Bucić, Jacob Fox, Huy Tuan Pham
wiley   +1 more source

A topological characterization of stabilizing consensus. [PDF]

Distrib Comput
Schmid U, Felber S, Rincon Galeana H.
europepmc   +1 more source

No‐(k+1)$(k+1)$‐in‐line problem for large constant k$k$

Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract How many points can be placed in an n×n$n\times n$ grid so that every (affine) line contains at most k$k$ points? We prove that for n⩾k⩾1037$n \geqslant k \geqslant 10^{37}$ the maximum number of points is exactly kn$kn$. Our proof builds on the recent work of Kovács, Nagy and Szabó (who proved an analogous result when k$k$ is at least about ...
Alexandr Grebennikov, Matthew Kwan
wiley   +1 more source

A recurrently perturbed 12-gene program marks drug-tolerant persister states across cancer types. [PDF]

Front Bioinform
Arora I, Adam AM, Aljaylani AO, Alzuhayri JZ, Ali EMM, Alzahrani FA, Khan MI, Yaqinuddin A.   +7 more
europepmc   +1 more source

Matchings: Source, goal, and faithful companion

Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.
Abstract Matchings were among the earliest motivations for graph theory. They subsequently remained a central goal, inspiring the development of new mathematical tools that went well beyond problems directly concerning matchings. These tools proved widely applicable, accompanying the growth of graph theory over the past century.
András Sebő
wiley   +1 more source