Minimum Wiener Connector Problem: Difference between revisions
Jump to navigation
Jump to search
(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...") |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
$n$: number of vertices | |||
m: number of edges | |||
q: number of query vertices | $m$: number of edges | ||
$q$: number of query vertices | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 09:24, 10 April 2023
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
$n$: number of vertices
$m$: number of edges
$q$: number of query vertices
Table of Algorithms
Currently no algorithms in our database for the given problem.