The complexity of independent set reconfiguration on bipartite graphs (Q4607889)
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: The complexity of independent set reconfiguration on bipartite graphs |
scientific article; zbMATH DE number 6850321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of independent set reconfiguration on bipartite graphs |
scientific article; zbMATH DE number 6850321 |
Statements
15 March 2018
0 references
0.9970384240150452
0 references
0.8977351784706116
0 references
0.8456448316574097
0 references
0.8102471232414246
0 references
0.8078429698944092
0 references
