Combinatorial problems on series-parallel graphs

Abstract This paper outlines the results and motivation of the paper [1], in which we showed, in a unified manner, that there exist linear time algorithms for many combinatorial problems defined on the class of series-parallel graphs.