Minimum Wiener Connector Problem: Difference between revisions

From Algorithm Wiki
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
Line 10: Line 10:
== Parameters ==  
== Parameters ==  


<pre>n: number of vertices
n: number of vertices
 
m: number of edges
m: number of edges
q: number of query vertices</pre>
 
q: number of query vertices


== Table of Algorithms ==  
== Table of Algorithms ==  

Revision as of 13:03, 15 February 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.

References/Citation

https://dl.acm.org/doi/10.1145/2723372.2749449

https://dl.acm.org/doi/10.1145/2723372.2749449