Parameterized complexity of independent set reconfiguration problems (Q2192091): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marcin Kaminski / rank
Normal rank
 
Property / author
 
Property / author: Marcin Kaminski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2020.01.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3008568895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token sliding on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set Reconfiguration in Cographs and their Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / 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: Linear-time algorithm for sliding tokens on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / 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: Q3395518 / 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: Fixed-Parameter Tractability of Token Jumping on Planar Graphs / 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: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration on sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration over Tree Decompositions / 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: Shortest Reconfiguration of Sliding Tokens on a Caterpillar / rank
 
Normal rank

Latest revision as of 00:44, 23 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of independent set reconfiguration problems
scientific article

    Statements

    Parameterized complexity of independent set reconfiguration problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2020
    0 references
    combinatorial reconfiguration
    0 references
    fixed parameter tractability
    0 references
    graph algorithm
    0 references
    independent set
    0 references

    Identifiers

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