Results 11 to 20 of about 309,661 (267)
The Path to Path-Traced Movies [PDF]
Foundations and Trends® in Computer Graphics and Vision, 2016 Path tracing is one of several techniques to render photorealistic images by simulating the physics of light propagation within a scene. The roots of path tracing are outside of computer graphics, in the Monte Carlo simulations developed for neutron transport.
Per H. Christensen, Wojciech Jarosz
openaire +2 more sources
Littelmann paths and Brownian paths [PDF]
Duke Mathematical Journal, 2005 We study some path transformations related to Littelmann path model and their applications to representation theory and Brownian motion in a Weyl chamber.
Biane, Philippe +2 more
openaire +5 more sources
Finding an induced path that is not a shortest path [PDF]
Discrete Mathematics, 2021 We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger +2 more
openaire +3 more sources
Physical Review Letters, 2020 Main Text: 5 pages, 5 figures, 7 equations.
Mandelli, Davide +2 more
openaire +4 more sources
Minimum path bases and relevant paths [PDF]
Networks, 2005 AbstractGiven an undirected graph G(V,E) and a vertex subset U ⊆ V the U‐space is the vector space over GF(2) spanned by the paths with end‐points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U‐space. Although the size distribution of subgraphs is the same in all minimum
Petra M. Gleiss +2 more
openaire +3 more sources
On the Lettericity of Paths [PDF]
Australas. J Comb., 2020 Verifying a conjecture of Petkov{š}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.
openaire +3 more sources
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
Journal of Philosophical Logic, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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