Sorting Networks On Restricted Topologies

Indranil Banerjee
Indranil Banerjee

SOFSEM, 2019.

Cited by: 0|Bibtex|Views5|Links
EI

Abstract:

The sorting number of a graph with n vertices is the minimum depth of a sorting network with n inputs and n outputs that uses only the edges of the graph to perform comparisons. Many known results on sorting networks can be stated in terms of sorting numbers of different classes of graphs. In this paper we show the following general resul...More

Code:

Data:

Your rating :
0

 

Tags
Comments