Complexity of independent set reconfigurability problems (Q441866)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6064148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of independent set reconfigurability problems |
scientific article; zbMATH DE number 6064148 |
Statements
Complexity of independent set reconfigurability problems (English)
0 references
8 August 2012
0 references
reconfiguration
0 references
independent set
0 references
perfect graphs
0 references
cographs
0 references
even-hole-free graphs
0 references
0 references
0 references
0.8977351784706116
0 references
0.8956210613250732
0 references
0.8743800520896912
0 references
0.8508979082107544
0 references
0.8402993679046631
0 references
