An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(95)00206-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052486876 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Algorithm for Cograph Recognition with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Comparability and Permutation Graphs / rank | |||
Normal rank | |||
Latest revision as of 10:11, 27 May 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
0 references
