Stability and Robustness: Reliability in the World of Uncertainty

Open ProblemThe Central TreeProblemHeuristics for theCTPFinal RemarksGiven graph G = (V, E). Is it true that if there existsa spanning tree T 0 and a sequence of MINCUTSETsMCS 1 , MCS 2 , ..., MCS k with |MCS 1 | + |MCS 2 | + |MCS k | =|V | − 1 where k is a number of iterations in GCH, such that T 0can be constructed as a union over all i of all edges e ∈ MCS i ,then T 0 is a central tree? In other words: suppose that when weexecute GCH all the edges from the MINCUTSET are included inthe final tree T 0 ; is it then true that T 0 is always a central tree?Heuristics for the Central Tree Problem Yury Nikulin - p. 20/33