Multiset linear extensions with a heuristic algorithm

키워드

참고문헌 (28)

1. B. Schroeder, "Ordered sets" (2003), Birkhaeuser
2. W. T. Trotter, "Combinatorics and partially ordered sets: Dimension Theory" (1992), The Johns Hop-kins University Press
3. W. T. Trotter, "Handbook of combinatorics", pp.433~480 (1995), Elsevier
4. E. Szpilrajn, "Sur l'extension de l'ordre partiel", Fund. Math, 16, pp.386~389 (1930)
5. G. Jenca, "Linear extensions and order-preserving poset partitions", Journal of Combinatorial Theory Series A, 122, pp.28~38 (2014)
6. R. C. Correa, "On extensions, linear extensions, upsets and downsets of ordered sets", Discrete Mathematics, 295, pp.13~30 (2005)
7. G. Brightwell, "Counting linear extensions", Order, 8(3), pp.225~242 (1991)
8. U. Faigle, "Minimizing completion time for a class of scheduling problems", Information Processing Letters, 19(1), pp.27~29 (1984)
9. M. M. Syslo, "On some new types of greedy chains and greedy linear extensions of partially ordered sets", Discrete Applied Mathematics, 60, pp.349~358 (1995)
10. I. Rival, "Greedy linear extensions with constraints", Discrete Mathematics, 63(2), pp.249~260 (1987)
11. H. A. Kierstead, "Super-greedy linear extensions of ordered sets", Annals of the New York Academy of Sciences, 555, pp.262~271 (2006)
12. P. Garcia-Segador, "Bottom-Up: a new algorithm to generate random linear extensions of a poset", Order, 36, pp.437~462 (2019)
13. L. Bianco, "An optimal algorithm to nd the jump number of partially ordered sets", Computational Optimization and Applications, 8(2), pp.197~210 (1997)
14. Y. L. Varol, "An algorithm to generate all topological sorting arrangements", The Computer Journal, 24(1), pp.83~84 (1981)
15. D. E. Knuth, "A structured program to generate all topological sorting arrangements", Information Processing Letters, 2, pp.153~157 (1974)
16. W. Blizard, "Multiset theory", Notre Dame Journal of Formal Logic, 30(1), pp.36~66 (1988)
17. R. R. Yager, "On the theory of bags", International Journal of General Systems, 13(1), pp.23~37 (1986)
18. H. Dang, "A single-sorted theory of multisets", Notre Dame Journal of Formal Logic, 55(3), pp.299~332 (2014)
19. D. Singh, "An overview of the applications of multisets", Novi Sad Journal of Mathematics, 37(2), pp.73~92 (2007)
20. F. Balogun, "Maximal and maximum antichains of ordered multisets", ANNALS OF FUZZY MATHEMATICS AND INFORMATICS, 21(1), pp.105~112 (2021), 기초자연과학연구소[DOI]
21. F. Balogun, "A study on some substructures of ordered multisets", Fudma Journal of Sciences, 2(1), pp.201~205 (2018)
22. K. P. Girish, "General relations between partially ordered multisets and their chains and antichains", Mathematical Communications, 14(2), pp.193~205 (2009)
23. M. Conder, "Orders on multisets and discrete cones", Order, 24, pp.277~296 (2007)
24. N. Dershowitz, "Proving termination with multiset orderings", Communications of the Journal of Association for Computing Machinery, 22, pp.465~476 (1979)
25. W. Blizard, "Real-valued multisets and fuzzy sets", Fuzzy Sets and Systems, 33, pp.77~97 (1989)
26. W. Blizard, "Negative membership", Notre Dame Journal of Formal Logic, 31(3), pp.346~368 (1990)
27. P. A. Felisiak, "Generalized multiset theory", Fuzzy Sets and Systems, 380, pp.104~130 (2020)
28. V. R. Pratt, "Modelling concurrency with partial orders", International Journal of Parallel Pro-gramming, 15, pp.33~71 (1986)

관련 논문AI추천