Поиск по каталогу |
(строгое соответствие)
|
- Профессиональная
- Научно-популярная
- Художественная
- Публицистика
- Детская
- Искусство
- Хобби, семья, дом
- Спорт
- Путеводители
- Блокноты, тетради, открытки
Successful Team Work - Graph Theoretic Approach. Approximation Algorithms for Identification of Comfortable Teams in Social Networks
В наличии
Местонахождение: Алматы | Состояние экземпляра: новый |
Бумажная
версия
версия
Автор: Lakshmi Prabha Sudharsanom
ISBN: 9783659775802
Год издания: 2015
Формат книги: 60×90/16 (145×215 мм)
Количество страниц: 260
Издательство: LAP LAMBERT Academic Publishing
Цена: 39993 тг
Положить в корзину
Позиции в рубрикаторе
Сферы деятельности:Код товара: 151120
Способы доставки в город Алматы * комплектация (срок до отгрузки) не более 2 рабочих дней |
Самовывоз из города Алматы (пункты самовывоза партнёра CDEK) |
Курьерская доставка CDEK из города Москва |
Доставка Почтой России из города Москва |
Аннотация: Under group dynamics, in any organization, it is very important to find a successful team or group, which is really a challenging job. In literature, various attributes of a team (group) are discussed regarding the success of a team, say, coordination,communication, cohesion, decision making, conflict management and so on. In this book, a new characteristic of a team called COMFORTABILITY is introduced. This book focuses on the problem of how to identify such a comfortable team in any given social network of an organization. The problem is modeled using Graph Theory. The existence of comfortable team is not guaranteed in any network. So, some more flexible comfortable teams are introduced, viz., good comfortable, better comfortable, highly comfortable and totally comfortable teams, such that they will exist always. It will be interesting to see how a comfortable team develops into a good, better and highly comfortable teams. Highly comfortable team is proved to be a successful team. As these problems are NP-complete, some polynomial-time approximation algorithms are given for finding flexible comfortable teams in any organization. Performance ratios of the algorithms are analyzed.
Ключевые слова: graph algorithms, Group Dynamics, social networks, comfortable team, domination, Approximation algorithms