BACKGROUND The purpose of this study was to compare the results of two popular surgical techniques for medial patellofemoral ligament MPFL reconstruction with a minimum of two-year follow-up. METHODS Fifty-eight patients with traumatic tear of the medial patellofemoral ligament were included in one of the two surgical groups. Group 1 MPFLs were reconstructed through graft endobutton fixation ...

The family of snarks – connected bridgeless cubic graphs that cannot be 3edge-coloured – is well-known as a potential source of counterexamples to several important and long-standing conjectures in graph theory. These include the cycle double cover conjecture, Tutte’s 5-flow conjecture, Fulkerson’s conjecture, and several others. One way of approaching these conjectures is through the study of ...

We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple $G'$ such can be obtained form by finite number $2$-cut reductions. As consequence, some hard conjectures as the (generalized) Berge-Fulkerson Conjecture Tutte's 3- 5-flow conjecture reduced to $r$-graphs.

The maximum flow problem is a type of network optimization problem in the flow graph theory. Many important applications used the maximum flow problem and thus it has been studied by many researchers using different methods. Ford Fulkerson algorithm is the most popular algorithm that used to solve the maximum flow problem, but its complexity is high. In this paper, a parallel Genetic algorithm ...

D. Ray Fulkerson (1922–1976) made fundamental and lasting contributions to combinatorial mathematics, optimization, and operations research [2]. He is probably best known for his work on network flows and in particular for the famous max flow–min cut theorem, stating that the maximum amount of a flow from a node s to a node t in a directed graph equals the minimum capacity of a cut separating s...