Results 51 to 60 of about 308,302 (304)
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
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
On the Crossing Number of Symmetric Configurations
For any finite set of points P in general position in the plane, we consider the drawing of the complete graph with vertex set P , whose edges are the straight-line segments joining pairs of points.
Bernardo M. Ábrego +1 more
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
A Note on the Crossing Numbers of 5-Regular Graphs
The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2.
Ouyang Zhangdong
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
Crossing numbers of meshes [PDF]
We prove that the crossing number of the cartesian product of 2 cycles, Cm× Cn, m≤n, is of order Ω(mn), improving the best known lower bound. In particular we show that the crossing number of Cm×Cn is at least mn/90, and for n=m, m+1 we reduce the constant 90 to 6.
Farhad Shahrokhi +3 more
openaire +1 more source
ABSTRACT Background Children with sickle cell disease (SCD) face multiple acute and chronic medical complications that may impact their quality of life as reported by patients themselves. Health‐related social needs (HRSNs), such as food and housing insecurity, are common in people with SCD, but the association between HRSNs and patient‐reported ...
Sarah J. Marks +5 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 radiation therapy presents unique challenges compared to adult treatments, including those of immobilization, potential need for sedation, and the critical importance of accurate, reproducible positioning. Additionally, heightened attention to imaging doses is necessary to minimize long‐term toxicity in survivors.
Parham Alaei +17 more
wiley +1 more source

