leRusHeyVhepAGCTIMhmjqVEeUY9inoYczxRstBhjVRlp4EtlcIIcfJbxlPE
Current position: Home >> Scientific Research >> Paper Publications

Can a permutation be sorted by best short swaps?

Hits:

Institution:计算机科学与技术学院

Title of Paper:Can a permutation be sorted by best short swaps?

First Author:张舒

All the Authors:朱大铭,姜海涛,郭炅,Feng Haodi

Document Code:B4129B94DF3946BB95E8200E160ED1B0

Translation or Not:No

Date of Publication:2018-07

Release Time:2019-04-14

Prev One:A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs

Next One:A 14/11-approximation algorithm for sorting by short block moves