Yüklüyor......
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...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Hindawi Limited
2013-01-01
|
| Seri Bilgileri: | Journal of Applied Mathematics |
| Online Erişim: | http://dx.doi.org/10.1155/2013/519173 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|