A Dominating Set Based Approach to Identify Effective Leader Group of Social Network

DOI10.1007/978-3-642-38768-5_77zbMath1382.91065OpenAlexW149736627MaRDI QIDQ4925306

Donghyun Kim, Alade O. Tokuta, Omid Asgari, Yingshu Li, Deying Li

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_77

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (2)

Efficient respondents selection for biased survey using homophily-high social relation graph ⋮ Computing an effective decision making group of a society using social network analysis

This page was built for publication: A Dominating Set Based Approach to Identify Effective Leader Group of Social Network