Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (Q4302282): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:13, 5 March 2024
scientific article; zbMATH DE number 618158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs |
scientific article; zbMATH DE number 618158 |
Statements
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (English)
0 references
14 August 1994
0 references
cocomparability graph
0 references
polynomial time algorithm
0 references
hamiltonian cycle
0 references
permutation graphs
0 references
partially ordered sets
0 references
