Efficient algorithms for interval graphs and circular-arc graphs (Q3956413): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Latest revision as of 16:46, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for interval graphs and circular-arc graphs |
scientific article |
Statements
Efficient algorithms for interval graphs and circular-arc graphs (English)
0 references
1982
0 references
maximum independent set
0 references
minimum covering by disjoint completely connected sets of cliques
0 references
maximum clique
0 references
