상세 보기
초록
Motivated by applications in social networks, a new type of dominating set has been studied in the literature. In this paper, we present results regarding the complexity and approximation in general graphs.
키워드
Dominating set; Greedy approximation; Social network; ALGORITHM
- 제목
- New dominating sets in social networks
- 저자
- Zhu, Xu; Yu, Jieun; Lee, Wonjun; Kim, Donghyun; Shan, Shan; Du, Ding-Zhu
- 발행일
- 2010-12
- 유형
- Article
- 권
- 48
- 호
- 4
- 페이지
- 633 ~ 642