A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

David A. Bader, Bernard M. E. Moret, Mi Yan. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Volume 2125 of Lecture Notes in Computer Science, pages 365-376, Springer, 2001. [doi]

Abstract

Abstract is missing.