Algorithmic aspects of homophyly of networks | |
Zhang, Peng; Li, Angsheng | |
刊名 | THEORETICAL COMPUTER SCIENCE
![]() |
2015 | |
卷号 | 593页码:117-131 |
关键词 | Homophyly Social networks Maximum happy vertices Maximum happy edges Approximation algorithms |
DOI | 10.1016/j.tcs.2015.06.003 |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4777280 |
专题 | 山东大学 |
作者单位 | 1.Shandong Univ, Sch Comp Sci & Technol, Jinan 250101, Peoples R China. 2.Chinese Acad Sci, Inst Software, State Key Lab C |
推荐引用方式 GB/T 7714 | Zhang, Peng,Li, Angsheng. Algorithmic aspects of homophyly of networks[J]. THEORETICAL COMPUTER SCIENCE,2015,593:117-131. |
APA | Zhang, Peng,&Li, Angsheng.(2015).Algorithmic aspects of homophyly of networks.THEORETICAL COMPUTER SCIENCE,593,117-131. |
MLA | Zhang, Peng,et al."Algorithmic aspects of homophyly of networks".THEORETICAL COMPUTER SCIENCE 593(2015):117-131. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论