Shortest reconfiguration sequence for sliding tokens on spiders (Q2294056)
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 7163792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest reconfiguration sequence for sliding tokens on spiders |
scientific article; zbMATH DE number 7163792 |
Statements
Shortest reconfiguration sequence for sliding tokens on spiders (English)
0 references
6 February 2020
0 references
sliding token
0 references
shortest reconfiguration
0 references
independent set
0 references
spider tree
0 references
polynomial-time algorithm
0 references
0.9254213571548462
0 references
0.9162988662719728
0 references
0.8539320230484009
0 references
0.8434418439865112
0 references
0.8175746202468872
0 references
