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
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding Hamiltonian circuits in proper interval graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum node disjoint path covering for circular-arc graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding Hamiltonian circuits in interval graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank | |||
Normal rank | |||
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
