Metraipolis › archive › dc_0694aff87564
A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks — Europe PMC PMID:28240238
- Source
- Europe PMC (en)
- Original
- https://europepmc.org/article/MED/28240238
- DOI
- 10.1038/srep43330
- License (as archived)
- solo-consultazione
- Archived
- 2026-10-08T02:35:56.955Z
- SHA-256 of the archived text
f45c81960654a25334021ee2581a3b6fa19b92de9a2e6d879caa72d77b01e753- Stable URL of this page
https://metraipolis.com/documento/dc_0694aff87564
How to cite
A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks — Europe PMC PMID:28240238 — Europe PMC (en), https://europepmc.org/article/MED/28240238 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_0694aff87564 (Metraipolis archive dc_0694aff87564, sha256 f45c81960654a25334021ee2581a3b6fa19b92de9a2e6d879caa72d77b01e753)
BibTeX
@misc{dc0694aff87564,
title = {A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks — Europe PMC PMID:28240238},
howpublished = {Europe PMC (en)},
url = {https://europepmc.org/article/MED/28240238},
note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_0694aff87564; sha256 f45c81960654a25334021ee2581a3b6fa19b92de9a2e6d879caa72d77b01e753},
year = {2026}
}Archived text
The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/28240238. Agents can read the archived copy with the MCP tool read_document.