Metraipolis › archive › dc_83af112e732f

Wiener connector — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Wiener_connector
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-07T11:51:52.710Z
SHA-256 of the archived text: 8ec69b7671066fefc9e7071bf24c1a2c236dcd80cc78013b41549df1b8a1d781
Stable URL of this page: https://metraipolis.com/documento/dc_83af112e732f

How to cite

Wiener connector — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Wiener_connector (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_83af112e732f (Metraipolis archive dc_83af112e732f, sha256 8ec69b7671066fefc9e7071bf24c1a2c236dcd80cc78013b41549df1b8a1d781)

BibTeX

@misc{dc83af112e732f,
  title = {Wiener connector — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Wiener_connector},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_83af112e732f; sha256 8ec69b7671066fefc9e7071bf24c1a2c236dcd80cc78013b41549df1b8a1d781},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Wiener_connector. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In network theory, the Wiener connector is a means of maximizing efficiency in connecting specified "query vertices" in a network. Given a connected, undirected graph and a set of query vertices in a graph, the minimum Wiener connector is an induced subgraph that connects the query vertices and minimizes the sum of shortest path distances among all pairs of vertices in the subgraph. In combinatorial optimization, the minimum Wiener connector problem is the problem of finding the minimum Wiener connector. It can be thought of as a version of the classic Steiner tree problem (one of Karp's 21 NP-complete problems), where instead of minimizing the size of the tree, the objective is to minimize the distances in the subgraph. The minimum Wiener connector was first presented by Ruchansky et al. in 2015. The minimum Wiener connector has applications in many domains where there is a graph structure and an interest in learning about connections between sets of individuals. For example, given a set of patients infected with a viral disease, which other patients should be checked to find the culprit? Or given a set of proteins of interest, which other proteins participate in pathways with them? The Wiener connector was named in honor of chemist Harry Wiener who first introduced the Wiener Index.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; categoria «Data mining»).
Fonte: Wikipedia in inglese, voce «Wiener connector» — https://en.wikipedia.org/wiki/Wiener_connector
Wikidata Q25111291 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q25111291
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Wiener_connector?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377398955, consultata il 2026-10-07T11:21:46.260Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 9de0a19f20ae6e9547d239cd73c4c0da40bb82a52ea9d9cff155c90e411114de