Algorithms for a maximum clique and a maximum independent set of a circle graph (Q5675749): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Incidence matrices and interval graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:49, 12 June 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
