Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
124 views

Hu-Gomory trees and Optimum Communication tree

It is known that that can be several trees in a graph that follow the conditions of "Cut-tree" (also called Hu-Gomory tree). For example (https://stackoverflow.com/questions/25297470/igraphs-gomory-...
Yotam Sali's user avatar
2 votes
0 answers
105 views

Is there a name for this variant of the MST and the TSP?

Suppose I am given a weighted graph $G$ that contains a "start vertex" $v_0$, and my goal is to construct a set of paths that all originate at $v_0$ and touch all of the vertices of $G$, with as ...
Tom Solberg's user avatar
  • 4,049
2 votes
0 answers
1k views

Incremental minimum spanning tree

Given a connected graph $G=(V,E)$ with a weight function $w:E\to\mathbb{R}$ and a subset $E_0\subseteq E$ such that the subgraph $(V,E_0)$ is connected, I am looking for a sequence $E_0\subseteq E_1\...
Thomas Kalinowski's user avatar