Sliding Tokens on Block Graphs (Q2980933)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Sliding Tokens on Block Graphs	scientific article

Statements

scholarly article

0 references

Sliding Tokens on Block Graphs (English)

0 references

0 references

Eli Fox-Epstein

0 references

0 references

WALCOM: Algorithms and Computation

0 references

publication date

5 May 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-53925-6_36

0 references

Reconfiguring Independent Sets in Claw-Free Graphs

0 references

Linear-time algorithm for sliding tokens on trees

0 references

0 references

Sliding Token on Bipartite Permutation Graphs

0 references

PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation

0 references

Sliding Tokens on a Cactus

0 references

On the complexity of reconfiguration problems

0 references

Complexity of independent set reconfigurability problems

0 references

Reconfiguration over Tree Decompositions

0 references

The complexity of change

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-53925-6_36

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2980933

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2980933&oldid=36319683"