EUVIMEDEUVIMED entdecken
Crossref

An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs

Ming Xie, Xiu-Xiu Zhan, Chuang Liu, Zi-Ke Zhang

Information Processing & Management · 2023-03 · 60 (2) · 103161

DOI: 10.1016/j.ipm.2022.103161 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Information Processing & Management, 2023-03. Verfasst von Ming Xie und 3 weiteren Autor:innen. Die Arbeit wurde bisher 111-mal zitiert (Crossref) und nennt 48 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Xie, M., Zhan, X., Liu, C., & Zhang, Z. (2023). An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs. Information Processing & Management, 60(2), 103161. https://doi.org/10.1016/j.ipm.2022.103161

Vancouver

Xie M, Zhan X, Liu C, Zhang Z. An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs. Information Processing & Management. 2023;60(2):103161. doi:10.1016/j.ipm.2022.103161

BibTeX
@article{Xie2023,
  author = {Xie, Ming and Zhan, Xiu-Xiu and Liu, Chuang and Zhang, Zi-Ke},
  title = {An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs},
  journal = {Information Processing & Management},
  year = {2023},
  volume = {60},
  number = {2},
  pages = {103161},
  doi = {10.1016/j.ipm.2022.103161}
}
Kostenlos starten →