Independent set reconfiguration parameterized by modular-width (Q5918925): Difference between revisions

From MaRDI portal
Merged Item from Q5919469
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5090459 / 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: 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: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Token on Bipartite Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / 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: 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: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607889 / 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: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / 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

Revision as of 10:09, 23 July 2024

scientific article; zbMATH DE number 7173307
Language Label Description Also known as
English
Independent set reconfiguration parameterized by modular-width
scientific article; zbMATH DE number 7173307

    Statements

    Independent set reconfiguration parameterized by modular-width (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 September 2020
    0 references
    24 February 2020
    0 references
    reconfiguration
    0 references
    independent set
    0 references
    modular-width
    0 references
    0 references
    0 references
    0 references

    Identifiers

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