A linear time algorithm to recognize circular permutation graphs (Q4887747): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A linear time algorithm to recognize circular permutation graphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199605)27:3<171::aid-net1>3.0.co;2-f / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009049598 / rank | |||
Normal rank | |||
| Property / title | |||
A linear time algorithm to recognize circular permutation graphs (English) | |||
| Property / title: A linear time algorithm to recognize circular permutation graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 11:02, 30 July 2024
scientific article; zbMATH DE number 913355
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
