Results 151 to 160 of about 511 (171)
Some of the next articles are maybe not open access.
Bases and circuits of fuzzifying matroids
2018Summary: In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievable example is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for the basis axioms and circuit axioms of crisp matroids respectively, are presented.
Yang, Shao-Jun, Shi, Fu-Gui
openaire +1 more source
Rough matroids based on relations
Information Sciences, 2013Rough sets provide an efficient tool for attribute reduction and rule extraction. However, many important problems in rough set theory, including attribute reduction, are NP-hard and therefore the algorithms for solving them are usually greedy. As a generalization of linear independence in vector spaces, matroids have wide applications in diverse ...
William Zhu 0001, Shiping Wang
openaire +1 more source
Weight Distribution of the Bases of a Matroid
Graphs and Combinatorics, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the th best base of a matroid
Operations Research Letters, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Complexity of the Minimum Base Game on Matroids
Mathematics of Operations Research, 1997This paper studies the complexity of computing solution concepts for a cooperative game, called the minimum base game (MBG) (E, c), where its characteristic function c : 2E ↦ ℜ is defined as c(S) = (the weight w(B) of a minimum weighted base B ⊆ S), for a given matroid M = (E, ℐ) and a weight function w : E ↦ ℜ.
Hiroshi Nagamochi +3 more
openaire +1 more source
Fuzzy Sets and Systems, 1989
The authors pursue their research on fuzzy matroids, a concept they introduced in a previous paper [see these authors, Fuzzy matroids, Fuzzy Sets and Systems 27, 291-302 (1988)]. They now deal with bases of fuzzy matroids. They show that not all matroids have fuzzy bases. They define a special class of fuzzy matroids that have them, called closed fuzzy
Goetschel, Roy jun., Voxman, William
openaire +2 more sources
The authors pursue their research on fuzzy matroids, a concept they introduced in a previous paper [see these authors, Fuzzy matroids, Fuzzy Sets and Systems 27, 291-302 (1988)]. They now deal with bases of fuzzy matroids. They show that not all matroids have fuzzy bases. They define a special class of fuzzy matroids that have them, called closed fuzzy
Goetschel, Roy jun., Voxman, William
openaire +2 more sources
Equicardinality of Bases in B-Matroids
Canadian Mathematical Bulletin, 1969It is very well known that any two bases of a finitary matroid (see [2] for definitions) have the same cardinality. As Dlab has shown in [1], the same does not hold for arbitrary transitive exchange spaces; indeed, since the examples Dlab constructs in [1] are matroids, it does not even hold for arbitrary matroids.
openaire +2 more sources
TRANSVERSAL MATROIDS, BASE-ORDERABLE MATROIDS, AND GRAPHS
The Quarterly Journal of Mathematics, 1972openaire +2 more sources
2014
In this paper, a characterization of [0, 1]-matroids is given. It is proved that a [0, 1]-matroid is equivalent to a hereditary fuzzy pre-matroid, and that a perfect [0, 1]-matroid is equivalent to a Goetschel-Voxman fuzzy matroid. It is proved that there is a one-to-one correspondence between the family of closed perfect [0, 1]-matroids on E and the ...
HUANG, Chun-e., SHİ, Fu-gui
openaire +1 more source
In this paper, a characterization of [0, 1]-matroids is given. It is proved that a [0, 1]-matroid is equivalent to a hereditary fuzzy pre-matroid, and that a perfect [0, 1]-matroid is equivalent to a Goetschel-Voxman fuzzy matroid. It is proved that there is a one-to-one correspondence between the family of closed perfect [0, 1]-matroids on E and the ...
HUANG, Chun-e., SHİ, Fu-gui
openaire +1 more source