1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017★ 1 cited
An Upper Bound of 7n/6 for the Minimum Size 2EC on Cubic 3-Edge Connected Graphs
Philippe Legault
In this paper, we study the minimum size 2-edge connected spanning subgraph problem (henceforth 2EC) and show that every 3-edge connected cubic graph G=(V, E), with n=|V| allows a…
cs.DM2016
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem
Sylvia Boyd, Philippe Legault
Given a complete graph with non-negative edge costs , the problem is that of finding a 2-edge connected spanning multi-subgraph of $K_{n}…