Stirling Numbers of Uniform Trees and Related Computational Experiments
The Stirling numbers for graphs provide a combinatorial interpretation of the number of cycle covers in a given graph. The problem of generating all cycle covers or enumerating these quantities on general graphs is computationally intractable, but recent work has shown that there exist infinite fami...
| الحاوية / القاعدة: | Algorithms |
|---|---|
| المؤلفون الرئيسيون: | , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
MDPI AG
2023-04-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.mdpi.com/1999-4893/16/5/223 |