Finding Hamiltonian circuits in interval graphs (Q1066674): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:52, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Hamiltonian circuits in interval graphs |
scientific article |
Statements
Finding Hamiltonian circuits in interval graphs (English)
0 references
1985
0 references
The problem of deciding whether a graph has a Hamiltonian circuit has been shown NP-complete on many restricted classes of graphs. This paper adds to the classes of graphs for which a polynomial time algorithm for the Hamiltonian circuit problem is known. A linear time algorithm for the problem in interval graphs is developed.
0 references
polynomial time algorithm
0 references
linear time algorithm
0 references
interval graphs
0 references
