Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (Q4302282)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 618158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8762049674987793
0 references
0.7968933582305908
0 references
0.7927653789520264
0 references
