Citation: J. Cheriyan et al., Improving on the 1.5-approximation of a smallest 2-edge connected spanningsubgraph, SIAM J DISC, 14(2), 2001, pp. 170-180
Citation: J. Cheriyan et K. Mehlhorn, An analysis of the highest-level selection rule in the preflow-push max-flow algorithm, INF PROCESS, 69(5), 1999, pp. 239-242