An Algorithm for Outerplanar Graphs with ParameterBinghuan Zhu, Wayne GoddardJ. Algorithms1991For n-vertex outerplanar graphs, it is proven that O(n) 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â€¦ (More)