搜索结果: 1-1 共查到“排队论 non-messing-up”相关记录1条 . 查询时间(0.129 秒)
A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the ...