August 5, 2013 16:7 WSPC/S1793-8309 257-DMAA 1392001

Discrete Mathematics, Algorithms and Applications

Vol. 5, No. 3 (2013) 1392001 (1 page)


c World Scientific Publishing Company
DOI: 10.1142/S1793830913920018

ERRATUM
UPPER BOUNDS FOR SORTING PERMUTATIONS
WITH A TRANSPOSITION TREE
Discrete Math. Algorithm. Appl. 2013.05. Downloaded from www.worldscientific.com

[Discrete Mathematics, Algorithms and Applications, Vol. 5, No. 1 (2013) 1350003]

by MICHIGAN STATE UNIVERSITY on 01/25/15. For personal use only.

BHADRACHALAM CHITTURI
Department of Computer Science
Amrita Vishwa Vidyapeetham University
Amritapuri Campus, Clappana P. O., Kollam 690525
Kerala, India
bhadrachalam@am.amrita.edu

Published 6 August 2013

• The title of Algorithm S, i.e., Steps (a)–(c) preceding the last paragraph on page 6,
appears on page 7.
• The idea given in the last paragraph of Sec. 6.1, i.e., Conclusions is correct in
principle. It is applicable to a subset of double brooms but it is not applicable
for brooms [1].
Σ ∗
• Page 12: (a) In Algorithm NC: (i) At termination C2k = Cmax , (ii) Cx denotes
the set of all clusters that are formed when limit = x.
(b) First paragraph: The definition of Cxy is not used in this paper.
(c) Last paragraph: The word check is to be read as a comparison.
• Page 13: In Algorithm D : (i) Cij must be replaced by C, (ii) lines 11–12 are
intended to convey the following: C(= S\X) ∈ O∗ , where X ∈ Cmax ∗
and |X| =
∗
argmaxi |Xi (∈ Cmax )| and distSum(X) = argmink distSum(Xk ). The critical
case for Algorithm D corresponds to |C| = 2S/3. In lines 16 and 23 if we replace
the > with ≥ and ≤ with < respectively, we get a variation of δ  i.e., δv2
. In fact,

our implementation results shown are for δv2 .

Reference
[1] Bhadrachalam Chitturi, A short note on sorting brooms with a transposition tree, in
Technical Report, University of Texas at Dallas, UTDCS-11-13.

1392001-1