Minimum Wiener Connector Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 10:2510:25, 15 February 2023‎ Admin talk contribs‎ 632 bytes +632‎ Created page with "{{DISPLAYTITLE:Minimum Wiener Connector Problem (Wiener Index)}} == Description == Given a connected graph $G = (V, E)$ and a set $Q \subseteq V$ of query vertices, find a subgraph of $G$ that connects all query vertices and has minimum Wiener index. == Related Problems == Related: Undirected Wiener Index == Parameters == <pre>n: number of vertices m: number of edges q: number of query vertices</pre> == Table of Algorithms == Currently no algorithms in our..."
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Minimum_Wiener_Connector_Problem"