A multi-stack method for the fast generation of permutations with minimal length increasing subsequences

被引：1

作者：

van Baronaigien, DR ^{[1
]}

机构：

[1] Univ Victoria, Dept Comp Sci, Victoria, BC V8W 3P6, Canada

来源：

INFORMATION PROCESSING LETTERS | 1999年 / 69卷 / 03期

关键词：

combinatorial problems; listing algorithms; constant amortized time;

D O I：

10.1016/S0020-0190(98)00208-7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A multi-stack, O(n) space, constant amortized time algorithm is presented for listing all permutations of the integers 1,2,...,n that contain a subsequence of length k where all of the elements in the subsequence are in increasing order. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

引用

页码：123 / 126

页数：4