Philippe Legault

According to our database, Philippe Legault authored at least 4 papers between 2015 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph.

Sylvia C. Boyd, Philippe Legault

SIAM J. Discret. Math., 2017

An Upper Bound of 7n/6 for the Minimum Size 2EC on Cubic 3-Edge Connected Graphs.

Philippe Legault

CoRR, 2017

2015

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem.

Sylvia C. Boyd, Philippe Legault

Electron. Notes Discret. Math., 2015

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem.

Sylvia C. Boyd, Philippe Legault

CoRR, 2015