Sliding Tokens on Block Graphs (Q2980933): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reconfiguring Independent Sets in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithm for sliding tokens on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Token on Bipartite Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Tokens on a Cactus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration over Tree Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank

Latest revision as of 18:14, 13 July 2024

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

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references