An algorithm for outerplanar graphs with parameter

For n-vertex outerplanar graphs, it is proven that O(n^2.87) is an upper bound on the number of breakpoints of the function which gives the maximum weight of an independent set, where the vertex weights vary as linear functions of a parameter. An O(n^2.87) algorithm for finding the solution is proposed.