Results 91 to 100 of about 214,966 (272)

Rainbow Spanning Trees in Complete Graphs Colored by One‐factorizations

open access: yes, 2017
Brualdi and Hollingsworth conjectured that, for even n, in a proper edge coloring of using precisely colors, the edge set can be partitioned into spanning trees which are rainbow (and hence, precisely one edge from each color class is in each spanning ...
Horn, Paul
core  

Deep learning on tertiary lymphoid structures in hematoxylin-eosin predicts cancer prognosis and immunotherapy response

open access: yesnpj Precision Oncology
Tertiary lymphoid structures (TLSs) have been associated with favorable immunotherapy responses and prognosis in various cancers. Despite their significance, their quantification using multiplex immunohistochemistry (mIHC) staining of T and B lymphocytes
Ziqiang Chen   +25 more
doaj   +1 more source

Long‐Term Follow‐Up of Chemotherapy‐Associated Biological Aging in Women With Early Breast Cancer

open access: yesAging and Cancer, EarlyView.
Women threated with adjuvant chemotherapy for early breast cancer have sustained long‐term increase in p16INK4a,, a robust marker of cell senescence, suggesting a chemotherapy‐associated age acceleration. p16INK4a as well as other biomarkers may identify patients at greatest risk for senescence‐related diseases of aging.
Hyman B. Muss   +12 more
wiley   +1 more source

Dynamic capacitated minimum spanning trees

open access: yes, 2004
— Given a set of terminals, each associated with a positive number denoting the traffic to be routed to a central terminal (root), the Capacitated Minimum Spanning Tree (CMST) problem asks for a minimum spanning tree, spanning all terminals, such that ...
Raja Jothi, Balaji Raghavachari
core  

Selecting Clusters and Protoclusters via Stellar Mass Density. II. Application to HSC-SSP Observations

open access: yesThe Astrophysical Journal
We present a selection of candidates of clusters and protoclusters of galaxies identified in the photometric data of the HSC-SSP Wide Public Data Release 3 (PDR3), spanning the redshift range 0.1 ≤ z ≤ 2. The selection method, detailed in Vicentin et al.,
Marcelo C. Vicentin   +4 more
doaj   +1 more source

CX3CL1 in Early Detection of Alzheimer's Disease: Plasma Dynamics Across Age and Disease Stages

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Backgrounds Alzheimer's disease (AD) is characterized by amyloid‐beta plaques, tau tangles, and neuroinflammation. C‐X3‐C motif chemokine ligand 1 (CX3CL1, also known as fractalkine), a neuroimmune chemokine implicated in AD pathogenesis, shows inconsistent alterations in plasma/serum across studies.
Ling Wang   +6 more
wiley   +1 more source

Graphs admitting antimagic labeling for arbitrary sets of positive integers [PDF]

open access: yes, 2017
A connected graph G=(V,E) with m edges is called universal antimagic if for each set B of m positive integers there is an bijective function f:E→B such that the function f˜:V→N defined at each vertex v as the sum of all labels of edges incident to v is ...
José Zamora   +3 more
core   +1 more source

Impact of Asymptomatic Intracranial Hemorrhage on Outcome After Endovascular Stroke Treatment

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Endovascular treatment (EVT) achieves high rates of recanalization in acute large‐vessel occlusion (LVO) stroke, but functional recovery remains heterogeneous. While symptomatic intracranial hemorrhage (sICH) has been well studied, the prognostic impact of asymptomatic intracranial hemorrhage (aICH) after EVT is less certain ...
Shihai Yang   +22 more
wiley   +1 more source

Approximating k-hop Minimum Spanning Trees in Euclidean metrics

open access: yes, 2008
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S.

core  

Two Applications of Random Spanning Forests

open access: yes, 2017
International audienceWe use random spanning forests to find, for any Markov process on a finite set of size n and any positive integer m
Gaudillière, Alexandre   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy