Results 31 to 40 of about 347,865 (289)
Algorithms and Data Structures [PDF]
I. Programming environments for motion, graphics, and geometryII. Programming concepts: beyond notationIII. Objects, algorithms, programsIV. Complexity of problems and algorithmsV. Data structuresVI.
Nievergelt, Jurg, Hinrichs, Klaus
core +1 more source
Approximating optimization problems in graphs with locational uncertainty [PDF]
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take any position in
Marin Bougeret +2 more
doaj +1 more source
New Results on Directed Edge Dominating Set [PDF]
We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at ...
Rémy Belmonte +4 more
doaj +1 more source
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]
In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann +2 more
doaj +1 more source
Approximate Distance Sensitivity Oracles in Subquadratic Space [PDF]
An $f$-edge fault-tolerant distance sensitive oracle ($f$-DSO) with stretch $\sigma \ge 1$ is a data structure that preprocesses a given undirected, unweighted graph $G$ with $n$ vertices and $m$ edges, and a positive integer $f$.
Davide Bilò +6 more
doaj +1 more source
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth [PDF]
Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$.
Zongwen Bai, Jianhua Tu, Yongtang Shi
doaj +1 more source
Composing dynamic programming tree-decomposition-based algorithms [PDF]
Given two integers $\ell$ and $p$ as well as $\ell$ graph classes $\mathcal{H}_1,\ldots,\mathcal{H}_\ell$, the problems $\mathsf{GraphPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell,p)$, \break $\mathsf{VertPart}(\mathcal{H}_1, \ldots, \mathcal{H}_\ell ...
Julien Baste
doaj +1 more source
Identifying Patterns of Hospitalizations Among Childhood Cancer Survivors: A Population‐Based Study
ABSTRACT Background Childhood cancer survivors (CCSs) experience more hospitalizations than the general population. We aimed to identify distinct hospitalization patterns among Queensland CCSs and the associated characteristics. Methods Cases (aged ≤14 years) diagnosed between 1995 and 2019 while residents of Queensland were identified through the ...
Hai Pham +7 more
wiley +1 more source
Comparative Visualization of Algorithms and Data Structures
Algorithms and data structures are principal parts of computer science education. For many students, however, it is not easy to master them due to their diversity and inherent complexity. The application of algorithm visualizations is a widely adopted approach, which can help to mitigate this difficulty.
Filip Vateha, Slavomír Simonák
openaire +2 more sources
ABSTRACT Purpose To explore caregivers' experiences and perceptions of the nutritional challenges faced by children and adolescents undergoing cancer treatment, including oral intake and the use of nutritional support. Methods This was a qualitative study based on focus groups with parents and caregivers at a Brazilian pediatric oncology hospital ...
Danyelle Apparecida Balsamão Marques +5 more
wiley +1 more source

