๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of finding generalized paths in tournaments

โœ Scribed by Pavol Hell; Moshe Rosenfeld

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
405 KB
Volume
4
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

On the complexity of finding paths in a
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
โœ Arthur W. Chou; Ker-I Ko ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 342 KB ๐Ÿ‘ 2 views

## Abstract The computational complexity of finding a shortest path in a twoโ€dimensional domain is studied in the Turing machineโ€based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomialโ€time computable twoโ€dimensional do

Finding Minimum Generators of Path Syste
Finding Minimum Generators of Path Systems
โœ Andrรกs Frank ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 102 KB

A simple algorithmic proof of a min max theorem of E. Gyo ri on generators of path systems is described. The algorithm relies on Dilworth's theorem.