An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:00, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An NC algorithm for the clique cover problem in cocomparability graphs and its application |
scientific article |
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
