Tree-Based Algorithms for Computing K-Combinations and K-Compositions
openalex（2010）
University of Nebraska–Lincoln
摘要
In this document, we describe two tree-based algorithms for computing all k-combinations and k-compositions of a finite set.
更多查看译文
关键词
Top-k Query Processing
分享
引用
