Fuzzy matroid sums and a greedy algorithm
The results of this paper follow the line of other publications of the authors in the same journal (see volumes 27, 31, 36, 37 and 51). Ten definitions fix the basic ideas related with the theory of fuzzy matroids (fm). A theorem establishes the role of the cardinality of a fm. The main result of this paper is provided by Theorem 4.1. A sufficient condition for the relation of the weights \(w(\alpha) \geq w(\beta)\), for each basis, is derived. Theorems 4.2 and 4.5 prove that this relationship holds for elementary fm sums in reduced form, when \(\alpha\) is selected for a certain greedy algorithm.
- Generalized matroids based on three-way decision models
- Fuzzy matroids and a greedy algorithm
- Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids
- Bases and circuits of fuzzifying matroids
- Degrees of M-fuzzy families of independent L-fuzzy sets
- Connectedness of refined Goetschel-Voxman fuzzy matroids
- Axioms for bases of closed regular fuzzy matroids
This page was built for publication: Fuzzy matroid sums and a greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311718)
