The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Routing Permutations on Graphs via Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on routing via matchings on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of token swapping and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum-length generator sequence problem is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding minimum-length generator sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time Complexity of the Token Swapping Problem and Its Parallel Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606338 / 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: How to write a permutation as a product of involutions (and why you might care) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / 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
Property / cites work
 
Property / cites work: Optimal Bounds for Matching Routing on Trees / rank
 
Normal rank

Latest revision as of 04:17, 18 July 2024

scientific article; zbMATH DE number 7021729
Language Label Description Also known as
English
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant
scientific article; zbMATH DE number 7021729

    Statements

    The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    time complexity
    0 references

    Identifiers