Fuzzy Sets and Systems
Fuzzy Sets and Systems
Fuzzy matroids and a greedy algorithm
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Spanning properties for fuzzy matroids
Fuzzy Sets and Systems
Fuzzy matroid sums and a greedy algorithm
Fuzzy Sets and Systems
Fuzzy Sets and Systems
A comment on “Bases of fuzzy matroids” Fuzzy Sets and Systems 31 (1989) 253–261
Fuzzy Sets and Systems
On fuzzy independence set systems
Fuzzy Sets and Systems
Closure axioms for a class of fuzzy matroids and co-towers of matroids
Fuzzy Sets and Systems
Fuzzy Sets and Systems
A new approach to the fuzzification of matroids
Fuzzy Sets and Systems
Some methods for evaluating the optimality of elements in matroids with ill-known weights
Fuzzy Sets and Systems
Fuzzy Sets and Systems
A possibilistic approach to combinatorial optimization problems on fuzzy-valued matroids
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Matroidal approaches to rough sets via closure operators
International Journal of Approximate Reasoning
Hi-index | 0.20 |
This paper studies connectedness of Goetschel-Voxman fuzzy matroids (briefly, G-V fuzzy matroids), an analog of connectedness of crisp finite matroids. Based on the results of fuzzy circuits given by Goetschel and Voxman, the transitivity theorem concerning fuzzy circuits of G-V fuzzy matroids is established, and thus the useful notion of refined G-V fuzzy matroid is introduced. The connectedness of refined G-V fuzzy matroids is then defined by using an equivalence relation on the set of all fuzzy points on the ground set, and some expected properties of these G-V fuzzy matroids are presented. Additionally, five kinds of fuzzy matroids are compared.