Denumerations of rooted trees and multisets
- 作者N.G. de Bruijn
- 卷第6卷
- 期第1期
- 印刷ISSN0166-218X
- 文件大小559.71KB
- 发表时间1983
- DOI10.1016/0166-218x(83)90097-5
- 页码25-33
A randomised 3-colouring algorithmA.D. Petford; D.J.A. Welsh · 1989
Materialised view selection using randomised algorithmsKumar, T.V. Vijay; Kumar, Santosh · International Journal of Business Information Systems · 2015
A simple randomised algorithm for convex optimisationDyer, M.; Kannan, R.; Stougie, L. · Mathematical Programming · 2014
Randomised algorithms for isomorphisms of simple typesGIL, JOSEPH (YOSSI); ZIBIN, YOAV · Mathematical Structures in Computer Science · 2007
A randomised inference algorithm for regular tree languagesHÖGBERG, JOHANNA · Natural Language Engineering · 2011
Randomised Local Search Algorithm for the Clustering ProblemP. Fränti; J. Kivijärvi · 2000
A randomised approximation algorithm for the hitting set problemEl Ouali, Mourad; Fohlin, Helena; Srivastav, Anand · Theoretical Computer Science · 2014
Tangential 1-blocks over GF(3)P.N. Walton; D.J.A. Welsh · 1982
A randomised 3-colouring algorithmA.D. Petford; D.J.A. Welsh · 1989
The random cluster processD.J.A. Welsh · 1994
Generalized versions of Hall's theoremD.J.A. Welsh · 1971
Euler and bipartite matroidsD.J.A. Welsh · 1969
Tutte polynomials computable in polynomial timeJ.G. Oxley; D.J.A. Welsh · 1992
A linking polynomial of two matroidsD.J.A. Welsh; K.K. Kayibi · Advances in Applied Mathematics · 2004