Results 71 to 80 of about 172,035 (261)
Improper colouring of (random) unit disk graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 For any graph $G$, the $k$-improper chromatic number $χ ^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a subgraph of maximum degree $k$.
Ross J. Kang +2 more
doaj +1 more source
Subgraphs of random graphs [PDF]
Transactions of the American Mathematical Society, 1985 Let Δ ⊆ [ ω ] 2 \Delta \subseteq {[\omega ]^2} be an undirected graph on ω \omega , and let u ∈ [ 0 , 1 ] u \in [0,\,1] . Following P. Erdös and A.
Fremlin, David H., Talagrand, Michel
openaire +1 more source
Molecular Oncology, EarlyView.This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns +10 more
wiley +1 more source
hergm: Hierarchical Exponential-Family Random Graph Models
Journal of Statistical Software, 2018 We describe the R package hergm that implements hierarchical exponential-family random graph models with local dependence. Hierarchical exponential-family random graph models with local dependence tend to be superior to conventional exponential-family ...
Michael Schweinberger, Pamela Luna
doaj +1 more source
Molecular Oncology, EarlyView.Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
Some Bounds for the Fragmentation Coefficient of Random Graphs
AxiomsGraph fragmentation aims to find the smallest vertex subset whose removal breaks a graph into components of bounded size. While this problem has applications in network dismantling and combinatorics, theoretical bounds on optimal solutions remain limited.
Katerina Adler, Reuven Cohen, Simi Haber
doaj +1 more source
Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs
Discrete Applied Mathematics, 2012 We prove that the treewidth of an Erd s-R nyi random graph $\rg{n, m}$ is, with high probability, greater than $ n$ for some constant $ > 0$ if the edge/vertex ratio $\frac{m}{n}$ is greater than 1.073. Our lower bound $\frac{m}{n} > 1.073$ improves the only previously-known lower bound.
openaire +2 more sources
Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma
Molecular Oncology, EarlyView.Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra +6 more
wiley +1 more source
RIPK4 function interferes with melanoma cell adhesion and metastasis
Molecular Oncology, EarlyView.RIPK4 promotes melanoma growth and spread. RIPK4 levels increase as skin lesions progress to melanoma. CRISPR/Cas9‐mediated deletion of RIPK4 causes melanoma cells to form less compact spheroids, reduces their migratory and invasive abilities and limits tumour growth and dissemination in mouse models.
Norbert Wronski +9 more
wiley +1 more source
Predicting quantum advantage by quantum walk with convolutional neural networks
New Journal of Physics, 2019 Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms.
Alexey A Melnikov +2 more
doaj +1 more source