Home › Entities › academia › An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs

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

Research article (Information Processing & Management, 2022) · cited 93× · AI/ML
academia openalex:W4310344321
Press Enter · cited answer in seconds

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

Summary

An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs is a scholarly article[1].

Key Facts

  • An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 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). An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-efficient-adaptive-degree-based-heuristic-algorithm-for-influence-maximization-in-hypergraphs
MLA “An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-efficient-adaptive-degree-based-heuristic-algorithm-for-influence-maximization-in-hypergraphs.
BibTeX @misc{4ortxyz_an-efficient-adaptive-degree-based-heuristic-algorithm-for-influence-maximization-in-hypergraphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs}}, year = {2026}, url = {https://4ort.xyz/entity/an-efficient-adaptive-degree-based-heuristic-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): An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs — https://4ort.xyz/entity/an-efficient-adaptive-degree-based-heuristic-algorithm-for-influence-maximization-in-hypergraphs (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/an-efficient-adaptive-degree-based-heuristic-algorithm-for-influence-maximization-in-hypergraphs · Last refreshed: