An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465): Difference between revisions
From MaRDI portal
Latest revision as of 08:31, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals |
scientific article |
Statements
An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (English)
0 references
1990
0 references
Hamiltonian path
0 references
Hamiltonian circuit
0 references
interval graph
0 references
0 references
