Results 71 to 80 of about 1,321,651 (326)

The crossing number of locally twisted cubes [PDF]

open access: yes, 2011
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H.
Liu, Bao   +5 more
core  

Predicting Chronicity in Children and Adolescents With Newly Diagnosed Immune Thrombocytopenia at the Timepoint of Diagnosis Using Machine Learning‐Based Approaches

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser   +6 more
wiley   +1 more source

The Crossing Numbers of Products of Path with Graphs of Order Six

open access: yesDiscussiones Mathematicae Graph Theory, 2013
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known.
Klešč Marián, Petrillová Jana
doaj   +1 more source

Crossing number of Cartesian product of prism and path

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
An m-prism is the Cartesian product of an m-cycle and a path with 2 vertices. We prove that the crossing number of the join of an m-prism () and a graph with k isolated vertices is km for each We then use this result to prove that the crossing number of ...
Yip C. Yiew, Gek L. Chia, Poh-Hwa Ong
doaj   +1 more source

Selection strategies for the development of maize introgression populations. [PDF]

open access: yesPLoS ONE, 2014
Introgression libraries are valuable resources for QTL detection and breeding, but their development is costly and time-consuming. Selection strategies for the development of introgression populations with a limited number of individuals and high ...
Eva Herzog   +5 more
doaj   +1 more source

Psychological Safety Among Interprofessional Pediatric Oncology Teams in Germany: A Nationwide Survey

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Psychological safety (PS) is essential for teamwork, communication, and patient safety in complex healthcare environments. In pediatric oncology, interprofessional collaboration occurs under high emotional and organizational demands. Low PS may increase stress, burnout, and adverse events.
Alexandros Rahn   +4 more
wiley   +1 more source

Developmental Disorders in Children Recently Diagnosed With Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Neurocognitive deficits in adult survivors of childhood cancer are well established, but less is known about developmental disorders (DD) arising shortly after cancer diagnosis. Using 2016–2019 linked Ohio cancer registry and Medicaid data, we compared DD among 324 children with cancer and 606,913 cancer‐free controls.
Jamie Shoag   +5 more
wiley   +1 more source

A Comparison of Void-finding Algorithms Using Crossing Numbers

open access: yesThe Astrophysical Journal, 2023
We study how well void-finding algorithms identify cosmic void regions and whether we can quantitatively and qualitatively compare the voids they find with dynamical information from the underlying matter distribution.
Dahlia Veyrat   +2 more
doaj   +1 more source

Characterizing Parental Concerns About Lasting Impacts of Treatment in Children With B‐Acute Lymphoblastic Leukemia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background B‐acute lymphoblastic leukemia (B‐ALL) is the most common pediatric cancer, and while most children in high‐resource settings are cured, therapy carries risks for long‐term toxicities. Understanding parents’ concerns about these late effects is essential to guide anticipatory support and inform evolving therapeutic approaches ...
Kellee N. Parker   +7 more
wiley   +1 more source

Conjectures About Wheels Without One Edge with Paths and Cycles

open access: yesMathematics
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
doaj   +1 more source

Home - About - Disclaimer - Privacy