A linear time algorithm to recognize circular permutation graphs (Q4887747)
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: Publication:4887747 |
scientific article; zbMATH DE number 913355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm to recognize circular permutation graphs |
scientific article; zbMATH DE number 913355 |
Statements
9 December 1996
0 references
permutation graphs
0 references
linear time
0 references
recognition
0 references
partial orders
0 references
A linear time algorithm to recognize circular permutation graphs (English)
0 references
0.7908692359924316
0 references
0.7841647863388062
0 references
0.7841529846191406
0 references
0.7841407656669617
0 references
0.7841077446937561
0 references
