Optimised Neighbourhood Methods

The goal of the -edge disjoint spanning tree algorithm (Min- -ST) [9] is to find a neighbourhood graph, G = (V, E), that is minimally -edge connected. 

Although the proposed graph algebra approach does present good results with a small computational overhead, there are no guarantees that a A -edge connected graph is formed. As such, it may be that an initial choice of k may be too small to produce 

---