Pages that link to "Item:Q1006060"
From MaRDI portal
The following pages link to The complexity of the matroid-greedoid partition problem (Q1006060):
Displaying 4 items.
- Greedy-type resistance of combinatorial problems (Q865746) (← links)
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction (Q2238210) (← links)
- Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids (Q2403318) (← links)
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion (Q2489961) (← links)