On the complexity of distance-\(d\) independent set reconfiguration (Q6091168): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2718334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3041243 / 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: 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: Reconfiguring Independent Sets on Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of graphs closed under taking powers / 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: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-\(d\) independent set problems for bipartite and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Token on Bipartite Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structurally parameterized \(d\)-scattered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square Roots of Graphs / 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: Q5133651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration on nowhere dense graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Graph Constraint Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration in bounded bandwidth and tree-depth / rank
 
Normal rank

Latest revision as of 14:25, 19 August 2024

scientific article; zbMATH DE number 7770297
Language Label Description Also known as
English
On the complexity of distance-\(d\) independent set reconfiguration
scientific article; zbMATH DE number 7770297

    Statements

    On the complexity of distance-\(d\) independent set reconfiguration (English)
    0 references
    0 references
    24 November 2023
    0 references
    reconfiguration problem
    0 references
    distance-\(d\) independent set
    0 references
    computational complexity
    0 references
    token sliding
    0 references
    token jumping
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers