Results 221 to 230 of about 316,590 (267)

Path coverings with paths

Journal of Graph Theory, 2001
The authors give two new proofs of a result by \textit{K. Heinrich}, \textit{D. Langdeau} and \textit{H. Verrall} [J. Comb. Des. 8, No. 2, 100-121 (2000; Zbl 0946.05022)] that provide necessary and sufficient conditions for the existence of a set \(S\) of 3-paths in \(K_n\) having the property the every 2-path in \(K_n\) lies in exactly one of the ...
J. W. McGee, Christopher A. Rodger
openaire   +2 more sources

Path specification and path coherence

Proceedings of the 9th annual conference on Computer graphics and interactive techniques, 1982
This paper presents an interactive method for specifying a path in space and time through a three-dimensional environment. A sequence is generated by showing the series of views along the path. The sequence is previewed on a vector scope, and after it is interactively refined, each frame is rendered on a raster device.
Kim L. Shelley, Donald P. Greenberg
openaire   +1 more source

Path tracing in Production: The Path of Water

ACM SIGGRAPH 2023 Courses, 2023
Physically-based light transport simulation has become a widely established standard to generate images in the movie industry. It promises various important practical advantages such as robustness, lighting consistency, progressive rendering and scalability.
Droske, Marc, Hanika, Johannes, Vorba, Jiří, Weidlich, Andrea, Sabbadin, Manuele   +4 more
openaire   +3 more sources

Tracking Paths

Discrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov   +3 more
openaire   +2 more sources

Path sensitization in critical path problem

1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers, 2002
Since the delay of a circuit is determined by the delay of its longest sensitizable paths (such paths are called critical paths), the problem of estimating the delay of a circuit is called critical path problem. One important aspect of the critical path problem is to decide whether a path is sensitizable.
Hsi-Chuan Chen, David Hung-Chang Du
openaire   +1 more source

A Relation Between Schröder Paths and Motzkin Paths

Graphs and Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin Yang 0029, Sheng-Liang Yang
openaire   +1 more source

On Parameterized Path and Chordless Path Problems

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007
We study the parameterized complexity of various path (and cycle) problems, the parameter being the length of the path. For example, we show that the problem of the existence of a maximal path of length k in a graph G is fixed-parameter tractable, while its counting version is #W[1]- complete. The corresponding problems for chordless (or induced) paths
Yijia Chen 0001, Jörg Flum
openaire   +1 more source

Path dependent types with path-equality

Proceedings of the 9th ACM SIGPLAN International Symposium on Scala, 2018
While the Scala type system provides expressive features like objects with type members, the lack of equality checking between path-dependent types prohibits some programming idioms. One such an example is abstract domain combinators in implementing static analyzers.
Jaemin Hong, Jihyeok Park, Sukyoung Ryu
openaire   +1 more source

The Path Taken for k-Path

2012
We give a historical account of the parametrized results for the k-Path problem: given a graph G and a positive integer k, is there a simple path in G of length k. Throughout the years several ingenious approaches have been used, steadily decreasing the run time bound. Moreover, the techniques used have often found lots of other applications.
openaire   +1 more source

Path Manifolds in a General Space of Paths

Journal of the London Mathematical Society, 1946
Not ...
openaire   +2 more sources