Algorithms for a maximum clique and a maximum independent set of a circle graph (Q5675749): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230030305 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052850644 / rank | |||
Normal rank | |||
Revision as of 19:16, 19 March 2024
scientific article; zbMATH DE number 3409400
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for a maximum clique and a maximum independent set of a circle graph |
scientific article; zbMATH DE number 3409400 |
Statements
Algorithms for a maximum clique and a maximum independent set of a circle graph (English)
0 references
1973
0 references
