Complexity of token swapping and its variants (Q722547): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59610428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Time Algorithms for Finding Small Tree and Path Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flips in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfigurations in Graphs and Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of completing partial Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / 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: Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting of Permutations by Cost-Constrained Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Token on Bipartite Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Sort by Walking on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Pebble Games and Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph puzzles, homotopy, and the alternating group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping labeled tokens on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping Colored Tokens on Graphs / rank
 
Normal rank

Latest revision as of 05:57, 16 July 2024

scientific article
Language Label Description Also known as
English
Complexity of token swapping and its variants
scientific article

    Statements

    Complexity of token swapping and its variants (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    token swapping
    0 references
    parameterized complexity
    0 references
    W[1]-hardness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references