AdjacentSwaps

AdjacentSwaps is a software tool, which is deveoped using GNU C++ language based on our previously developed TSG software tool [1]. It uses group-theoretic methods to find a minimum-length sequence of adjacent swaps required to sort an initial (bijective) assignment between n objects and n vertices in a graph with a line, ring, star, or complete topology.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element


References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Kim, Dohan: Sorting on graphs by adjacent swaps using permutation groups (2016)