Full Paper View Go Back
Arogya Dahal1 , Kalyan Khatiwada2 , Siddhartha Gautam3
Section:Research Paper, Product Type: Journal-Paper
Vol.9 ,
Issue.6 , pp.82-84, Dec-2021
Online published on Dec 31, 2021
Copyright © Arogya Dahal, Kalyan Khatiwada, Siddhartha Gautam . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: Arogya Dahal, Kalyan Khatiwada, Siddhartha Gautam, “A Super Permutation Algorithm,” International Journal of Scientific Research in Computer Science and Engineering, Vol.9, Issue.6, pp.82-84, 2021.
MLA Style Citation: Arogya Dahal, Kalyan Khatiwada, Siddhartha Gautam "A Super Permutation Algorithm." International Journal of Scientific Research in Computer Science and Engineering 9.6 (2021): 82-84.
APA Style Citation: Arogya Dahal, Kalyan Khatiwada, Siddhartha Gautam, (2021). A Super Permutation Algorithm. International Journal of Scientific Research in Computer Science and Engineering, 9(6), 82-84.
BibTex Style Citation:
@article{Dahal_2021,
author = {Arogya Dahal, Kalyan Khatiwada, Siddhartha Gautam},
title = {A Super Permutation Algorithm},
journal = {International Journal of Scientific Research in Computer Science and Engineering},
issue_date = {12 2021},
volume = {9},
Issue = {6},
month = {12},
year = {2021},
issn = {2347-2693},
pages = {82-84},
url = {https://www.isroset.org/journal/IJSRCSE/full_paper_view.php?paper_id=2610},
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
UR - https://www.isroset.org/journal/IJSRCSE/full_paper_view.php?paper_id=2610
TI - A Super Permutation Algorithm
T2 - International Journal of Scientific Research in Computer Science and Engineering
AU - Arogya Dahal, Kalyan Khatiwada, Siddhartha Gautam
PY - 2021
DA - 2021/12/31
PB - IJCSE, Indore, INDIA
SP - 82-84
IS - 6
VL - 9
SN - 2347-2693
ER -
63 Views
118 Downloads
36 Downloads
Abstract :
We present an algorithm that ?nds a string that contains every permutation of n symbols as a contiguous sub string, also called super permutation, from a given starting permutation. The algorithm is simple and can be implemented for any element, as the algorithm is independent of the representation of n. The algorithm also produces shortest super permutation for n smaller than 6.
Key-Words / Index Term :
Super Permutation; Algorithm; Mathematics
References :
[1] Robin Houston. “Tackling the minimal superpermutation problem.” arXiv:1408.5108, 2014
[2] Gilbert Laporte and Silvano Martello. “The selective travelling salesman problem.” “Discrete applied mathematics”: pp. 193–207, 1990.
[3] Desmond Lobo, Kalpita Wagaskar, Sarang Gawane, Clifford Fernandes, "Hybrid Quantum - Classical AI based approach to solve the Traveling Tournament Problem", International Journal of Computer Sciences and Engineering, Vol.9, Issue.6, pp.83-90, 2021.
[4] S. Suriya, M. Rahul Kumar, "Solving Travelling Salesman Problem using an Enhanced Ant Colony Algorithm", International Journal of Computer Sciences and Engineering, Vol.7, Issue.7, pp.214-222, 2019.
You do not have rights to view the full text article.
Please contact administration for subscription to Journal or individual article.
Mail us at support@isroset.org or view contact page for more details.
