Open k-monopolies in graphs: complexity and related concepts
Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the notion of majorities, for instance to consensus problems, diagnosis problems or voting systems. We introduce here open...
| الحاوية / القاعدة: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| المؤلفون الرئيسيون: | , , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
Discrete Mathematics & Theoretical Computer Science
2016-03-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://dmtcs.episciences.org/654/pdf |