ERRATUM: "UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE"

DOI10.1142/S1793830913920018zbMath1275.05026OpenAlexW2080096863MaRDI QIDQ2864865

Bhadrachalam Chitturi

Publication date: 26 November 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830913920018

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Number-theoretic algorithms; complexity (11Y16) Distance in graphs (05C12)

Related Items (1)

Token Swapping on Trees

This page was built for publication: ERRATUM: "UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE"