TITLE

새로운 상호연결망 하프 버블정렬 그래프 설계 및 성질 분석

AUTHOR(S)
서정현; 심현; 이형옥
PUB. DATE
July 2017
SOURCE
Journal of the Korea Institute of Information & Communication En;Jul2017, Vol. 21 Issue 7, p1327
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The Bubble sort graph is node symmetric, and can be used in the data sorting algorithm. In this research we propose and analyze that Half Bubble sort graph that improved the network cost of Bubble sort graph. The Half Bubble sort graph’s number of node is n!, and its degree is [n/2]+1. The Half Bubble sort graph’s degree is ≅0.5 times of the Bubble sort, and diameter is ≅0.9 times of the Bubble sort. The network cost of the Bubble sort graph is ≅0.5n3, and the network cost of the half Bubble sort graph is ≅0.2n3. We have proved that half bubble sort graph is a sub graph of the bubble sort graph. In addition, we proposed a routing algorithm and analyzed the diameter. Finally, network cost is compared with the bubble sort graph.
ACCESSION #
125498837

 

Related Articles

  • sort.  // Computer Desktop Encyclopedia;2015, p1 

    (1) To reorder data into a new sequence. See sorter, counting sort, bubble sort, quick sort and selection sort.

  • 30 SECOND GUIDE TO ... BUBBLES.  // Daily Mail;3/ 7/2014, p75 

    What sort of bubbles?

  • 30 SECOND GUIDE TO ...  // Daily Mail;3/ 7/2014, p75 

    What sort of bubbles?

  • Basic programming Part 8: sorting data. Holmes, Geoffrey // Accountancy;Nov79, Vol. 90 Issue 1035, p92 

    This article provides information on how data sorting can be made easier. Most computer systems have operating software which provides for the sorting of data, so that the programmer does not have to write his own; but it is an instructive exercise. There are more sophisticated sort routines,...

  • A Novel Sorting Algorithm and Comparison with Bubble sort and Insertion sort. Arora, Nitin; Tamta, Vivek Kumar; Kumar, Suresh // International Journal of Computer Applications;May2012, Vol. 45, p31 

    Sort is an algorithm that arranges all elements of an array, orderly. Sorting Technique is frequently used in a large variety of important applications to arrange the data in ascending or descending order. Several Sorting Algorithms of different time and space complexity are exist and used. This...

  • Java. Simon, Travis // Australian Personal Computer;May99, Vol. 20 Issue 5, p158 

    Discusses the arrays and looping statements included in the Java programming language. Efficiency of the bubble sort as a sorting algorithm; Importance of sorting to programming; Steps in compiling and running the loop. INSET: The bubble sort program..

  • sort.  // Computer Desktop Encyclopedia;10/1/2011, p1 

    To reorder data into a new sequence. The operating system can typically sort file names and text lists. Word processors typically allow lines of text to be reordered, and database programs sort records by one or more fields, often generating a new file. See sorter, counting sort, bubble sort,...

  • An Evaluation of the Critical Factors Affecting the Efficiency of Some Sorting Techniques. Olabiyisi, S. O.; Adetunji, A. B.; Oyeyinka, F. I. // International Journal of Modern Education & Computer Science;Feb2013, Vol. 5 Issue 2, p25 

    Sorting allows information or data to be put into a meaningful order. As efficiency is a major concern of computing, data are sorted in order to gain the efficiency in retrieving or searching tasks. The factors affecting the efficiency of shell, Heap, Bubble, Quick and Merge sorting techniques...

  • selection sort.  // Computer Desktop Encyclopedia;10/1/2011, p1 

    A sorting technique that is typically used for sequencing small lists. It starts by comparing the entire list for the lowest item and moves it to the #1 position. It then compares the rest of the list for the next-lowest item and places it in the #2 position and so on until all items are in the...

  • AN ALGORITHM OF TWO-WAY PASSED AND STABLY QUICK SORT (TPQA). Ruyun Wang; Zhentao Zang; Yinxian Yu; Di Cao // Far East Journal of Applied Mathematics;Aug2015, Vol. 92 Issue 2, p115 

    In this paper, an algorithm for sorting data is studied. For large data, due to huge repeated exchanges and comparisons of TPBEA, time complexity of the algorithm is much high. Hence, for improvement, an algorithm of two-way passed and stably quick sort is given by using the auxiliary-sort...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics