Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 166465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs |
scientific article; zbMATH DE number 166465 |
Statements
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (English)
0 references
16 May 1993
0 references
A tournament is an oriented digraph in which every pair of vertices is joined by an arc. An in-tournament digraph is a digraph in which the set of in-neighbours of each vertex induces a tournament. This note gives an \(O(m+n\log n)\) algorithm for finding a longest path and cycle in an in- tournament digraph, where \(m\) and \(n\) are the numbers of arcs respectively vertices of the in-tournament digraph.
0 references
tournament
0 references
in-tournament digraph
0 references
algorithm
0 references
path
0 references
cycle
0 references
0.8631438612937927
0 references
0.8502573370933533
0 references
0.845340371131897
0 references
0.8237529397010803
0 references
