Загрузка...
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 |
| Online-ссылка: | http://dx.doi.org/10.1155/2013/519173 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|