On the NP-Completeness of Computing the Commonality Among the Objects Upon Which a Collection of Agents Has Performed an Action

Computación y Sistemas

Raul Monroy¹  Roberto Alonso¹ 

关键词: Social Group Commonality;    complexity theory;    social networks;    graphs.;   

DOI  :  

学科分类：电子、光学、磁材料

来源: Instituto Politecnico Nacional * Centro de Investigacion en Computacion

【 摘 要 】

We prove the NP-completeness of the so-called Social Group Commonality (SGC) problem which queries the commonality among the objects ‘touched’ by collections...

【 授权许可】

Unknown