Results 51 to 60 of about 307,259 (304)
On the Problems of
A connected graph, G, is Crossing Free-connected (CF-connected) if there is a path between every pair of vertices with no crossing on its edges for each optimal drawing of G.
Michal Staš, Mária Timková
doaj +1 more source
Crossing number of Cartesian product of prism and path
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
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj +1 more source
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj +1 more source
Approximating the Bundled Crossing Number
Bundling crossings is a strategy which can enhance the readability of graph drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main result is that there is a polynomial-time algorithm to compute an 8-approximation of the bundled ...
Arroyo, Alan, Felsner, Stefan
openaire +2 more sources
ABSTRACT Primary lung carcinomas and bronchial carcinoid tumors (BC) are very rare malignancies in childhood. While typical BC and mucoepidermoid carcinomas are mostly low‐grade, localized tumors with a more favorable prognosis than in adults, necessitating avoidance of overtreatment, adenocarcinomas of the lung are often diagnosed at advanced disease ...
Michael Abele +19 more
wiley +1 more source
An Evolutionary Formulation of the Crossing Number Problem
A graph drawing algorithm is presented which results in complete graphs having minimum crossings equal to that of Guy's conjecture. It is then generalized and formulated in an evolutionary algorithm (EA) to perform constrained search for the crossing ...
Che Sheng Gan +3 more
doaj +1 more source
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
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
Influence of virtual reality training on the roadside crossing judgements of child pedestrians
The roadside crossing judgments of children aged 7, 9, and 11 years were assessed relative to controls before and after training with a computer-simulated traffic environment.
Morrison, S. +5 more
core +1 more source

