लोड हो रहा है...
Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
Covering is a widely used form of data structures. Covering-based rough set theory provides a systematic approach to this data. In this paper, graphs are connected with covering-based rough sets. Specifically, we convert some important concepts in graph theory including vertex covers, independent se...
में बचाया:
मुख्य लेखकों: | , , , |
---|---|
स्वरूप: | Artigo |
भाषा: | Inglês |
प्रकाशित: |
Hindawi Limited
2013-01-01
|
श्रृंखला: | Journal of Applied Mathematics |
ऑनलाइन पहुंच: | http://dx.doi.org/10.1155/2013/519173 |
टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|