EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Efficient Algorithm to Find Influential Nodes Using Community-Based Hybrid Centrality in Complex Networks

Anupoju Tejaswi, Murali Krishna Enduri, T. Jaya Lakshmi, Srilatha Tokala

IEEE Access · 2026 · 14 · 53728-53747

DOI: 10.1109/access.2026.3678205 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Anupoju Tejaswi und 3 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 48 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: SRM University-AP towards the Article Processing Charges.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • SRM University-AP towards the Article Processing Charges

Zitieren

APA

Tejaswi, A., Enduri, M. K., Lakshmi, T. J., & Tokala, S. (2026). Efficient Algorithm to Find Influential Nodes Using Community-Based Hybrid Centrality in Complex Networks. IEEE Access, 14, 53728-53747. https://doi.org/10.1109/access.2026.3678205

Vancouver

Tejaswi A, Enduri MK, Lakshmi TJ, Tokala S. Efficient Algorithm to Find Influential Nodes Using Community-Based Hybrid Centrality in Complex Networks. IEEE Access. 2026;14:53728-53747. doi:10.1109/access.2026.3678205

BibTeX
@article{Tejaswi2026,
  author = {Tejaswi, Anupoju and Enduri, Murali Krishna and Lakshmi, T. Jaya and Tokala, Srilatha},
  title = {Efficient Algorithm to Find Influential Nodes Using Community-Based Hybrid Centrality in Complex Networks},
  journal = {IEEE Access},
  year = {2026},
  volume = {14},
  pages = {53728--53747},
  doi = {10.1109/access.2026.3678205}
}
Kostenlos starten →