An output sensitive algorithm for computing a maximum independent set of a circle graph (Q765500)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An output sensitive algorithm for computing a maximum independent set of a circle graph |
scientific article; zbMATH DE number 6016047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An output sensitive algorithm for computing a maximum independent set of a circle graph |
scientific article; zbMATH DE number 6016047 |
Statements
An output sensitive algorithm for computing a maximum independent set of a circle graph (English)
0 references
19 March 2012
0 references
design of algorithms
0 references
graph algorithms
0 references
circle graph
0 references
maximum independent set
0 references
maximum stable set
0 references
0.8791066408157349
0 references
0.8602706789970398
0 references
0.8586366772651672
0 references
0.8423193097114563
0 references
0.8370839953422546
0 references
