Some new combinatorial algorithms with appropriate representations of solutions
Combinatorial problems are those problems, whose requirements are an association of some conditions. The construction of efficient algorithms to find solutions of the combinatorial problems is still an interesting matter. In this paper, we choose appropriate representations for desirable solutions...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
H. : ĐHQGHN
2017
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://repository.vnu.edu.vn/handle/VNU_123/56347 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Combinatorial problems are those problems, whose requirements are an association of some conditions. The construction of efficient algorithms to find solutions of the combinatorial problems is still an interesting matter. In this paper, we choose appropriate representations for desirable solutions of the permutation problem and the partition problem. Then we sort the representations of a problem's solutions in the alphabetical order. Owing to it we construct two new algorithms for quickly finding all solutions of these problems. |
|---|