Metraipolis › archive › dc_534cfdfbcf26

A social network graph partitioning algorithm based on double deep Q-Network — Europe PMC PMID:41038900

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/41038900
DOI
10.1038/s41598-[numero omesso]-x
License (as archived)
solo-consultazione
Archived
2026-10-07T20:52:40.928Z
SHA-256 of the archived text
4fbe86e0e10ba2008bbacece9fcb02208604ff754235226ddf9b45576c6f48aa
Stable URL of this page
https://metraipolis.com/documento/dc_534cfdfbcf26

How to cite

A social network graph partitioning algorithm based on double deep Q-Network — Europe PMC PMID:41038900 — Europe PMC (en), https://europepmc.org/article/MED/41038900 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_534cfdfbcf26 (Metraipolis archive dc_534cfdfbcf26, sha256 4fbe86e0e10ba2008bbacece9fcb02208604ff754235226ddf9b45576c6f48aa)
BibTeX
@misc{dc534cfdfbcf26,
  title = {A social network graph partitioning algorithm based on double deep Q-Network — Europe PMC PMID:41038900},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/41038900},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_534cfdfbcf26; sha256 4fbe86e0e10ba2008bbacece9fcb02208604ff754235226ddf9b45576c6f48aa},
  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/41038900. Agents can read the archived copy with the MCP tool read_document.