Results 111 to 120 of about 978,459 (257)
Deterministic Online Bipartite Edge Coloring
We study online bipartite edge coloring, with nodes on one side of the graph revealed sequentially. The trivial greedy algorithm is (2 — o (1))-competitive, which is optimal for graphs of low maximum degree, Δ = O (log n) [BNMN IPL’92].
Vintan, Radu +11 more
core +1 more source
Taxanes are widely used chemotherapeutics whose effects on cellular mechanics remain poorly understood. We show that paclitaxel induces rapid cellular contraction by promoting GEF‐H1 dissociation from microtubules and non‐muscle myosin II activation through RhoA/ROCK.
Gloria Asensio‐Juárez +5 more
wiley +1 more source
Incomplete microwave ablation (iMWA) of liver cancer triggers a biphasic progression in residual tumors. At Day 3, the microenvironment is characterized by acute inflammatory responses and extracellular matrix (ECM) remodeling. By Day 14, a profound shift occurs toward oncogenic signal transduction and immunosuppression, marked by macrophage ...
Yu Liu +9 more
wiley +1 more source
Distributed Edge Coloring and Locally Sparse Graph Coloring
Graph coloring is a central problem in distributed computing. In this work, we study both the edge coloring and vertex coloring problems. For constant ɛ> 0, we give a distributed algorithm for (1 + ɛ)∆-edge coloring running in O(log ∗ log n ∆ · max(1,
Hsin-hao Su, Seth Pettie, Michael Elkin
core
Circulating microRNA profiles distinguish nonmalignant Lynch syndrome from cancer‐associated Lynch syndrome, sporadic colorectal cancer, and healthy controls. Age‐stratified analysis reveals disease‐specific regulatory states, and a six‐miRNA panel shows concordant separation in an independent colorectal tissue cohort.
Ramadhani Salum Chambuso +5 more
wiley +1 more source
The kinase SRPK1 directly interacts with the protein TOPBP1 and regulates the pre‐mRNA splicing of WIZ thereby contributing to the activation of the ATR/CHK1 replicative checkpoint in response to replicative stress. This allows cancer cells' genomic stability and survival.
Amani Shreim +17 more
wiley +1 more source
THE LOCATING RAINBOW EDGE CONNECTION NUMBERS OF SOME GENERALIZED SUN GRAPHS
Throughout this paper, G denotes a finite, simple, connected, and undirected graph. The concept of the locating rainbow edge connection number is motivated by the concept of the locating rainbow connection number in which the coloring is assigned to ...
Muhammad Ahnaf Yusuf +2 more
doaj +1 more source
Edge-Coloring and f-Coloring for Various Classes of Graphs
In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a positive integer assigned to v.
Xiao Zhou, Takao Nishizeki
core
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
Mutant p53R273H disrupts PDPK1 homodimerization and contributes to PDPK1 activation
How mutant p53R273H drives AKT signaling is unclear. We show that p53R273H, but not wild‐type, directly binds PDPK1 via a mutation‐dependent conformational change. This interaction disrupts inhibitory PDPK1 homodimerization and enhances AKT phosphorylation.
Mei Chee Lim +11 more
wiley +1 more source

