Results 21 to 30 of about 751,203 (314)
Along dark paths (Per opaca viarum) [PDF]
, 2021 For wind orchestra and six solo celli. Along Dark Paths (Per Opaca Viarum) was commissioned by the Koninklijk Harmonieorkest Vooruit Harelbeke, and is dedicated to them and Mr. Erik Desimpelaere in friendship.
Hesketh, K.
core +3 more sources
, 2023 <p><strong>TAS-Paths</strong></p> <p>Pathfinding software for neutron triple-axis spectrometers, part of the <a href="https://doi.org/10.5281/zenodo.4117437">Takin</a> software package.</p> <p>The ...
Weber, Tobias
core +1 more source
Note on the problem of partially link disjoint paths [PDF]
, 2003 This paper discusses the problem of partially link disjoint paths in communication networks. The problem is situated in between the well-known shortest path generation and the synthesis of two disjoint paths.
R.J. Harris +3 more
core +1 more source
On the basis of the direct product of paths and wheels
International Journal of Mathematics and Mathematical Sciences, 1996 The basis number, b(G), of a graph G is defined to be the least integer k such that G has a k-fold basis for its cycle space. In this paper we determine the basis number of the direct product of paths and wheels.
A. A. Al-Rhayyel
doaj +1 more source
Percursos de regresso ao trabalho após acidente: confronto com novos obstáculos
Laboreal, 2018 This paper discusses the obstacles the injured workers have to face upon their return to work after the accident. Two studies developed in Portugal support the analysis and the reflection on this issue. One of the studies is the outcome of a request from
Cláudia Pereira +2 more
doaj +1 more source
Stability of the path–path Ramsey number
Discrete Mathematics, 2009 For graphs \(G_1, G_2, \dots, G_r\) the Ramsey number \(R(G_1, G_2, \dots, G_r)\) is the smallest positive integer \(n\) such that if the edges of a complete graph \(K_n\) are partitioned into \(r\) disjoint colour classes giving \(r\) graphs \(H_1, H_2, \dots, H_r\), then at least one \(H_i\), \(1\leq i\leq r\), contains a subgraph isomorphic to \(G_i\
András Gyárfás +2 more
openaire +2 more sources
Lipschitz-stability of controlled rough paths and rough differential equations [PDF]
, 2022 We provide an account for the existence and uniqueness of solutions to rough differential equations in infinite dimensions under the framework of controlled rough paths.
Boedihardjo, Horatio, Geng, Xi
core +1 more source
Structure Connectivity and Substructure Connectivity of
IEEE Access, 2019 We present new results on the fault tolerability of $k$ -ary $n$ -cube (denoted $Q_{n}^{k}$ ) networks. $Q_{n}^{k}$ is a topological model for interconnection networks that has been extensively studied since proposed, and this paper is concerned ...
Guozhen Zhang, Dajin Wang
doaj +1 more source
jimmynewland/paths-up-expeditions-in-computing-ret2018: PATHS-UP/Expeditions in Computing RET 2018
, 2020 PATHS-UP and Expeditions in Computing RET 2018 This python code is part of the Rice University PATHS-UP/Expeditions in Computing RET. Two separate data acquisition channels are available.
Jimmy Newland
core +1 more source
, 2023 The composition of Where the Paths End occupied me for about a year between August 2022 and July 2023. As a result it encompasses many different concepts and processes. On the surface, the piece has four different manifestations.
Clancy, Seán
core +1 more source