Showing 2016Show all
2 papers · 1 filter
math.CO2016
On the Maximum-Weight Basis Problem
Brahim Chaourar
Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(comple…
cs.DS2016
A linear time algorithm for a variant of the max cut problem in series parallel graphs
Brahim Chaourar
Given a graph , a connected sides cut or is the set of edges of E linking all vertices of U to all vertices of such that the i…