Document Zbl 0644.05036

from until

One-Line Search

add line

Document Type:

Journal Articles

Collection Articles

Books

arXiv Preprints

Document Type:

Journal Articles

Collection Articles

Books

arXiv Preprints

Reset all

New Multi-Line Search

Help

Examples

Geometry Search for the term Geometry in any field. Queries are case-independent.

Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.

"Topological group" Phrases (multi-words) should be set in "straight quotation marks".

au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.

Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.

Quasi* map* py: 1989 The resulting documents have publication year 1989.

so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.

"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.

dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.

py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).

la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Fields

any	anywhere
an	internal document identifier
au	author, editor
ai	internal author identifier
ti	title
la	language
so	source
ab	review, abstract
py	publication year
rv	reviewer
cc	MSC code
ut	uncontrolled term
dt	document type (j: journal article; b: book; a: book article)

Operators

a & b	logic and
a \| b	logic or
!ab	logic not
abc*	right wildcard
"ab c"	phrase
(ab c)	parentheses

Fats parallel algorithms for finding Hamiltonian paths and cycles in a tournament. (English) Zbl 0644.05036

J. Algorithms 9, No. 2, 276-286 (1988).

A directed graph \(T=(V,E)\) is a tournament, if for any pair u, v of vertices either (u,v)\(\in E\) or (v,u)\(\in E\) but not both.
Parallel NC algorithms are given for the following problems: finding a Hamiltonian path, finding a Hamiltonian path with a fixed endpoint, finding the strongly connected components, and finding a Hamiltonian cycle if T is strongly connected.

Reviewer: J.Ebert

Cited in 1 Review

Cited in 10 Documents

MSC:

05C45	Eulerian and Hamiltonian graphs
68R10	Graph theory (including graph drawing) in computer science
68Q25	Analysis of algorithms and problem complexity

Keywords:

parallel algorithm; directed graph; tournament; Hamiltonian path; strongly connected components; Hamiltonian cycle

Cite Review PDF

Full Text: DOI