Apply Sorting Algorithms to FAST Problem

10/15/2019
by   Sadra Mohammadshirazi, et al.
0

FAST problem is finding minimum feedback arc set problem in tournaments. In this paper we present some algorithms that are similar to sorting algorithms for FAST problem and we analyze them. We present Pseudo_InsertionSort algorithm for FAST problem and we show that average number of all backward edges in output of that is equal to ((n^2-5n+8)/4)-2^(1-n). We introduce Pseudo_MergeSort algorithm and we find the probability of being backward for an edge. Finally we introduce other algorithms for this problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2021

Is this the simplest (and most surprising) sorting algorithm ever?

We present an extremely simple sorting algorithm. It may look like it is...
research
03/03/2022

A Formalisation of Algorithms for Sorting Network

This notes explains how standard algorithms that construct sorting netwo...
research
04/24/2023

Sorting wild pigs

Chjara, breeder in Cargèse, has n wild pigs. She would like to sort her ...
research
09/05/2022

Fast geometric trim fitting using partial incremental sorting and accumulation

We present an algorithmic contribution to improve the efficiency of robu...
research
07/05/2021

Defeating duplicates: A re-design of the LearnedSort algorithm

LearnedSort is a novel sorting algorithm that, unlike traditional method...
research
10/29/2021

Sliding window strategy for convolutional spike sorting with Lasso : Algorithm, theoretical guarantees and complexity

We present a fast algorithm for the resolution of the Lasso for convolut...
research
04/24/2017

Fast Sorting Algorithms using AVX-512 on Intel Knights Landing

This paper describes fast sorting techniques using the recent AVX-512 in...

Please sign up or login with your details

Forgot password? Click here to reset