The complexity of independent set reconfiguration on bipartite graphs (Q4629977)
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 7044611
| 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 7044611 |
Statements
The Complexity of Independent Set Reconfiguration on Bipartite Graphs (English)
0 references
28 March 2019
0 references
independent set
0 references
bipartite graphs
0 references
reconfiguration
0 references
solution space
0 references
vertex cover
0 references
0.9970384240150452
0 references
0.8956210613250732
0 references
0.8483918905258179
0 references
0.8124228715896606
0 references
0.8097203969955444
0 references
