A RECURRENCE TEMPLATE FOR SEVERAL PARAMETERS IN SERIES-PARALLEL GRAPHS

We present a single set of recurrence parameters and a single set of r ecurrence relations which can be used to provide a linear algorithm fo r evaluating a wide class of graph theoretic parameters for series-par allel graphs. The set of recurrences presented here is no larger than has been necessary in solving any one of the parameters. Problems that can be solved using our template of recurrence relations include thos e involving the concepts of domination, packing, redundance, and indep endence.