An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615)
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: An NC algorithm for the clique cover problem in cocomparability graphs and its application |
scientific article; zbMATH DE number 984457
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An NC algorithm for the clique cover problem in cocomparability graphs and its application |
scientific article; zbMATH DE number 984457 |
Statements
An NC algorithm for the clique cover problem in cocomparability graphs and its application (English)
0 references
27 February 1997
0 references
Cocomparability graphs
0 references
Permutation graphs
0 references
Minimum clique cover
0 references
Depth-first search
0 references
0 references
