Lanean...
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...
Gorde:
Egile Nagusiak: | , , , |
---|---|
Formatua: | Artigo |
Hizkuntza: | Inglês |
Argitaratua: |
Hindawi Limited
2013-01-01
|
Saila: | Journal of Applied Mathematics |
Sarrera elektronikoa: | http://dx.doi.org/10.1155/2013/519173 |
Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|