# Minimum Wiener Connector Problem (Wiener Index)

Jump to navigation
Jump to search

## 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.