The base-matroid and inverse combinatorial optimization problems
Discrete Applied Mathematics
Transversal and function matroidal structures of covering-based rough sets
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Hi-index | 0.00 |
Let M=(E,F) be a rank-n matroid on a set E and B one of its bases. A closed set @q@?E is saturated with respect to B, or B-saturated, when |@q@?B|=r(@q), where r(@q) is the rank of @q. The collection of subsets I of E such that |I@?@q|=