A cost-optimal pipeline algorithm for permutation generation in lexicographic order

DOI10.1006/JPDC.1997.1347zbMath0886.68072OpenAlexW1988570837MaRDI QIDQ1373870

Clémentin Tayou Djamegni, Maurice Tchuente

Publication date: 25 November 1997

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1997.1347

zbMATH Keywords

permutation generation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

This page was built for publication: A cost-optimal pipeline algorithm for permutation generation in lexicographic order