An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimum (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals |
scientific article; zbMATH DE number 4151834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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; zbMATH DE number 4151834 |
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
0.8014110922813416
0 references
0.7621830105781555
0 references
0.7575148344039917
0 references
0.7466374039649963
0 references
0.7436451315879822
0 references
