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

Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament

โœ Scribed by Danny Soroker

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
554 KB
Volume
9
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A comparison of three algorithms for fin
A comparison of three algorithms for finding fundamental cycles in a directed graph
โœ Doris R. Ryan; Stephen Chen ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 543 KB

## Abstract Given a connected directed graph and a spanning tree, we consider the problem of finding the set of fundamental cycles. In particular, for each cotree arc __i__ and tree arc __j__, we need to know whether or not __i__ and __j__ are in the same fundamental cycle, and if so, whether or no

Analysis of parallel algorithms for find
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
โœ H. Chen; A. M. Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study