Results 61 to 70 of about 14,970 (213)
International Journal of Network Management, Volume 35, Issue 4, July/August 2025.ABSTRACT Determining the optimal granularity level for microservices applications is a critical challenge in modern software architecture. This study leverages the Service Weaver framework to investigate the performance and resilience implications of different service granularity configurations in a public cloud environment.
Camila Medeiros Rêgo +2 more
wiley +1 more source
Dense H-free graphs are almost (Χ(H)-1)-partite [PDF]
, 2010 By using the Szemeredi Regularity Lemma, Alon and Sudakov recently extended the classical Andrasfai-Erdos-Sos theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true.
Allen, Peter
core +2 more sources
Discrete Analysis, 2020 An efficient container lemma, Discrete Analysis 2020:17, 56 pp. The hypergraph container lemma, discovered independently in 2012 by David Saxton and Andrew Thomason, and by József Balogh, Robert Morris and Wojciech Samotij, is an extremely powerful tool
Jozsef Balogh, Wojciech Samotij
doaj +1 more source
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph F$$ F $$, there exists a quantity c(F)$$ c(F) $$ such that χ(G)≤(c(F)+o(1))Δ/logΔ$$ \chi (G)\le \left(c(F)+o(1)\right)\Delta /\mathrm{log}\Delta $$ whenever G$$ G $$ is an F$$ F $$‐free graph of maximum degree Δ$$ \Delta $$. The largest class of connected graphs F$$
James Anderson +2 more
wiley +1 more source
Cacti with Extremal PI Index [PDF]
, 2016 The vertex PI index $PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)]$ is a distance-based molecular structure descriptor, where $n_{xy}(x)$ denotes the number of vertices which are closer to the vertex $x$ than to the vertex $y$ and which has been the
Wang, Chunxiang +2 more
core +1 more source
Applied Research, Volume 4, Issue 3, June 2025.The development of a nanobody for Nogo‐A, a potent neurite outgrowth inhibitor crucial in multiple sclerosis, is reported using a rational design approach. The nanobody targets the Nogo‐A ectodomain at the S1PR2 receptor‐binding region with submicromolar KD.
Vaidehi Roy Chowdhury +9 more
wiley +1 more source
Undecidability of polynomial inequalities in weighted graph homomorphism densities
Forum of Mathematics, SigmaMany problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights.
Grigoriy Blekherman +2 more
doaj +1 more source
Simple juntas for shifted families
Discrete Analysis, 2020 **For the moment the link is to the submitted version of the article. It will be updated when the final version has been posted to arXiv.** Simple juntas for shifted families, Discrete Analysis 2020:14, 18 pp.
Peter Frankl, Andrey Kupavskii
doaj +1 more source
Sparse graph signals – uncertainty principles and recovery
GAMM-Mitteilungen, Volume 48, Issue 2, June 2025.ABSTRACT We study signals that are sparse either on the vertices of a graph or in the graph spectral domain. Recent results on the algebraic properties of random integer matrices as well as on the boundedness of eigenvectors of random matrices imply two types of support size uncertainty principles for graph signals.
Tarek Emmrich +2 more
wiley +1 more source
WIREs Computational Statistics, Volume 17, Issue 2, June 2025.A four‐run orthogonal array for three two‐level factors. ABSTRACT Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and beautiful mathematical theory.
C. Devon Lin, John Stufken
wiley +1 more source