Results 61 to 70 of about 477,458 (300)
The minimum cut criteria illustration.
, 2019 The minimum cut criteria illustration.
Yu Xin (412564) +4 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Wilms tumor (WT) treatment imposes a significant time burden on patients and their families. Time toxicity is a patient‐centered metric that quantifies the burden of healthcare interaction. We sought to define time toxicity in the first year after diagnosis of WT and hypothesized that it would increase as tumor stage and treatment ...
Caleb Q. Ashbrook +6 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Central nervous system (CNS) involvement in childhood acute lymphoblastic leukemia (ALL) is assessed by cell counting and cytomorphology from cerebrospinal fluid (CSF) and is used for treatment stratification worldwide. The ratio of “CNS2” patients in clinical trials ranges from 3% to 40%, with unclear prognostic significance ...
Laura Almási +14 more
wiley +1 more source
Graph Clustering and Minimum Cut Trees [PDF]
Internet Mathematics, 2004 Summary: We introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods are general enough to apply to any kind of graph but are well suited for graphs where the link structure implies a notion of reference, similarity, or endorsement, such as web and citation graphs. We show that the quality of the produced
Flake, Gary William +2 more
openaire +3 more sources
The Role of Hematopoietic Cell Transplantation in Ataxia‐Telangiectasia
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Ataxia‐telangiectasia (A‐T) is a DNA repair disorder characterized by neurodegeneration, immunodeficiency, and cancer predisposition. Hematopoietic cell transplantation (HCT) is an established therapy in related disorders such as Fanconi anemia (FA) and Nijmegen breakage syndrome (NBS), but its role in A‐T is unclear.
Laila Alkhouli +3 more
wiley +1 more source
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts [PDF]
Journal of Combinatorial Optimization, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang Zhao 0013 +2 more
openaire +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi +5 more
wiley +1 more source
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Complexity, 2021 Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present
Zhen-Mu Hong +3 more
doaj +1 more source
Fast hypergraph minimum cut algorithm
, 1999 [[abstract]]We present the fastest algorithm known today for computing a global minimum cut in a hypergraph. Unlike most minimum cut algorithms which rely on flow computations in a network, ours is a non-flow based algorithm.
Mak,Wai-Kei, Wong,D. F.
core +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Bloodstream infections due to repeated vascular access (VA) puncture and circuit connections remain major concerns in hemodialysis. Therefore, we examined current practices for glove, disinfectant, and personal protective equipment (PPE) use according to VA type in national university hospitals in Japan.
Aiko Yamada +6 more
wiley +1 more source