Efficient algorithms for interval graphs and circular-arc graphs (Q3956413)
From MaRDI portal
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
