On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence
Тип публикации: Journal Article
Дата публикации: 2016-01-29
SCImago Q3
WOS Q2
БС3
SJR: 0.36
CiteScore: 2.6
Impact factor: 1.1
ISSN: 13826905, 15732886
Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics
Control and Optimization
Discrete Mathematics and Combinatorics
Краткое описание
Bharathi et al. (WINE, pp 306–311, 2007) conjectured that the influence maximization problem is NP-hard for arborescence directed into a root. In this note, we show that this conjecture is not true for deterministic diffusion model and linear threshold (LT) model, that is, there exist polynomial-time algorithms for the influence maximization problem in those two models on arborescence directed into a root. This means that if the conjecture in the independent cascade (IC) model is true, then it would give an interesting difference between the IC model and the LT model.
Найдено
Ничего не найдено, попробуйте изменить настройки фильтра.
Для доступа к списку цитирований публикации необходимо авторизоваться.
Топ-30
Журналы
|
1
2
3
4
5
|
|
|
Springer Optimization and Its Applications
5 публикаций, 31.25%
|
|
|
Journal of Combinatorial Optimization
4 публикации, 25%
|
|
|
ACM Transactions on Knowledge Discovery from Data
1 публикация, 6.25%
|
|
|
ACM Transactions on Information Systems
1 публикация, 6.25%
|
|
|
Algorithms
1 публикация, 6.25%
|
|
|
Journal of Global Optimization
1 публикация, 6.25%
|
|
|
Social Network Analysis and Mining
1 публикация, 6.25%
|
|
|
Theoretical Computer Science
1 публикация, 6.25%
|
|
|
IEEE Transactions on Computational Social Systems
1 публикация, 6.25%
|
|
|
1
2
3
4
5
|
Издатели
|
2
4
6
8
10
12
|
|
|
Springer Nature
11 публикаций, 68.75%
|
|
|
Association for Computing Machinery (ACM)
2 публикации, 12.5%
|
|
|
MDPI
1 публикация, 6.25%
|
|
|
Elsevier
1 публикация, 6.25%
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
1 публикация, 6.25%
|
|
|
2
4
6
8
10
12
|
- Мы не учитываем публикации, у которых нет DOI.
- Статистика публикаций обновляется еженедельно.
Вы ученый?
Создайте профиль, чтобы получать персональные рекомендации коллег, конференций и новых статей.
Войти с ORCID
Метрики
16
Всего цитирований:
16
Цитирований c 2025:
0
Цитировать
ГОСТ |
RIS |
BibTex |
MLA
Цитировать
ГОСТ
Скопировать
Wang A. et al. On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence // Journal of Combinatorial Optimization. 2016. Vol. 31. No. 4. pp. 1678-1684.
ГОСТ со всеми авторами (до 50)
Скопировать
Wang A., Wu W., Cui L. On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence // Journal of Combinatorial Optimization. 2016. Vol. 31. No. 4. pp. 1678-1684.
Цитировать
RIS
Скопировать
TY - JOUR
DO - 10.1007/s10878-016-9991-1
UR - https://doi.org/10.1007/s10878-016-9991-1
TI - On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence
T2 - Journal of Combinatorial Optimization
AU - Wang, Ailian
AU - Wu, Weili
AU - Cui, Lei
PY - 2016
DA - 2016/01/29
PB - Springer Nature
SP - 1678-1684
IS - 4
VL - 31
SN - 1382-6905
SN - 1573-2886
ER -
Цитировать
BibTex (до 50 авторов)
Скопировать
@article{2016_Wang,
author = {Ailian Wang and Weili Wu and Lei Cui},
title = {On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence},
journal = {Journal of Combinatorial Optimization},
year = {2016},
volume = {31},
publisher = {Springer Nature},
month = {jan},
url = {https://doi.org/10.1007/s10878-016-9991-1},
number = {4},
pages = {1678--1684},
doi = {10.1007/s10878-016-9991-1}
}
Цитировать
MLA
Скопировать
Wang, Ailian, et al. “On Bharathi–Kempe–Salek conjecture for influence maximization on arborescence.” Journal of Combinatorial Optimization, vol. 31, no. 4, Jan. 2016, pp. 1678-1684. https://doi.org/10.1007/s10878-016-9991-1.
Ошибка в публикации?