ロード中...
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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|