An Algorithm for Minimal Number-Grouped Partitions of Random Permutations
Received:June 24, 1988  
Key Words:   
Fund Project:
Author NameAffiliation
Ding Kenquan Dept. Math.
Univ. Wisconsin-Madison
Madison
Wl 53706 
Hits: 1839
Download times: 904
Abstract:
      In this paper, by means of a kind of strongly isomorphic cutting-branch technique, an algorithm for the problem of finding the minimal number-grouped partitions of random permutations is given, and the open problem in [ 1] is solved.
Citation:
DOI:10.3770/j.issn:1000-341X.1990.04.006
View Full Text  View/Add Comment