𝔖 Bobbio Scriptorium
✦   LIBER   ✦
Cover of Sarah Winters: Finding a Path

Sarah Winters: Finding a Path

✍ Scribed by Briggs, Jason A

Book ID
108902771
Publisher
Tyamina Publishing
Year
2016
Tongue
English
Weight
30 KB
Category
Fiction
ISBN-13
9780992339548

No coin nor oath required. For personal study only.

✦ Synopsis

Overview: Sarah Winters is standing at the crossroads of her life's path.

πŸ“œ SIMILAR VOLUMES

A note on finding shortest path trees
A note on finding shortest path trees
✍ Aaron Kershenbaum πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 107 KB πŸ‘ 1 views
Finding a manhattan path and related pro
Finding a manhattan path and related problems
✍ Witold Lipski Jr. πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 599 KB

Let S be a set of n horizontal and vertical segments on the plane, and let s, t E S. A Manhattan path (of length k ) from s to t is an alternating sequence of horizontal and vertical segments s = ro, rl, . . . , rk = t where ri intersects ri+, , 0 < i < k . An from all s ES to r. Also given is a met

Finding a monochromatic subgraph or a ra
Finding a monochromatic subgraph or a rainbow path
✍ AndrΓ‘s GyΓ‘rfΓ‘s; JenΕ‘ Lehel; Richard H. Schelp πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

## Abstract For simple graphs __G__ and __H__, let __f__(__G__,__H__) denote the least integer __N__ such that every coloring of the edges of __K__~__N__~ contains either a monochromatic copy of __G__ or a rainbow copy of __H__. Here we investigate __f__(__G__,__H__) when __H__ = __P__~__k__~. We s

Finding an Oriented Hamiltonian Path in
Finding an Oriented Hamiltonian Path in a Tournament
✍ FrΓ©dΓ©ric Havet πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 153 KB

We present an O n algorithm for finding a specified oriented path of order at Ε½ 2 . least n in a tournament of order n. Using this algorithm, we present an O n algorithm that finds a specified oriented path from a given vertex if one exists.