HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs

Research article (Mathematics, 2024) · cited 11× · AI/ML
Press Enter · cited answer in seconds

HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs

Summary

HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs is a scholarly article[1].

Key Facts

  • HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/hedv-greedy-an-advanced-algorithm-for-influence-maximization-in-hypergraphs
MLA “HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/hedv-greedy-an-advanced-algorithm-for-influence-maximization-in-hypergraphs.
BibTeX @misc{4ortxyz_hedv-greedy-an-advanced-algorithm-for-influence-maximization-in-hypergraphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs}}, year = {2026}, url = {https://4ort.xyz/entity/hedv-greedy-an-advanced-algorithm-for-influence-maximization-in-hypergraphs}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs — https://4ort.xyz/entity/hedv-greedy-an-advanced-algorithm-for-influence-maximization-in-hypergraphs (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/hedv-greedy-an-advanced-algorithm-for-influence-maximization-in-hypergraphs · Last refreshed: