On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3117234799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6087216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token sliding on split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token sliding on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Independent Set in H-Free Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring Independent Sets in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token jumping in minor-closed classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for circular colouring reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of the graph of vertex-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithm for Sliding Tokens on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Token on Bipartite Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ground State Connectivity of Local Hamiltonians / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / 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: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of list edge-colorings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity for Token Jumping on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Token Jumping on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Independent Set Reconfiguration on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration on sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip distance between two triangulations of a point set is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Reconfiguration and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration in bounded bandwidth and tree-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism reconfiguration via homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 12:34, 26 July 2024

scientific article
Language Label Description Also known as
English
On girth and the parameterized complexity of token sliding and Token Jumping
scientific article

    Statements

    On girth and the parameterized complexity of token sliding and Token Jumping (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2021
    0 references
    combinatorial reconfiguration
    0 references
    independent set
    0 references
    Token Jumping
    0 references
    Token Sliding
    0 references
    parameterized complexity
    0 references
    0 references
    0 references

    Identifiers