Minimizing bumps for posets of width two (Q1114719)

Let \(L=\{x_ 1<...<x_ n\}\) be a linear extension of a finite partially ordered set P. A pair \((x_ i,x_ i+1)\) forms a bump in L whenever \(x_ i<x_ i+1\) in P. The author gives an effective solution for the problem of finding a linear extension with a minimum number of bumps when the width of P is two.