Fast combinatorial and graph algorithms

快速组合和图形算法

• 批准号: 298335-2007
• 负责人: Sawada, Joe
• 金额: $ 1.38万
• 依托单位: University of Guelph
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2011
• 资助国家: 加拿大
• 起止时间: 2011-01-01 至 2012-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=480691
• 关键词: Fast; combinatorial; graph; algorithms

Suppose you are given a bag containing blue and yellow beads and are asked the following questions: How many different necklaces can you make with exactly 5 blue beads and 5 yellow beads? For this problem observe that the necklace "bbbbbyyyyy" is the same as "bbyyyyybbb" when the beads are rotated by 3 positions. Thus, when you attempt to produce a list of such necklaces, it is not a trivial task to ensure that there are no duplicates.

假设你有一个装有蓝色和黄色珠子的袋子，并被问到以下问题：你能用5颗蓝色珠子和5颗黄色珠子做多少条不同的项链？ 对于这个问题，观察项链“bbbbyyyy”是相同的“bbyyyybbb”时，珠旋转了3个位置。 因此，当您尝试生成此类项链的列表时，确保没有重复项并不是一项简单的任务。