Paper Info
Title
A recurrence template for several parameters in series-parallel graphs
Abstract
We present a single set of recurrence parameters and a single set of recurrence relations which can be used to provide a linear algorithm for evaluating a wide class of graph theoretic parameters for series–parallel 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 those involving the concepts of domination, packing, redundance, and independence.
Year
DOI
Venue
1994
10.1016/0166-218X(94)90020-5
Discrete Applied Mathematics
Keywords
Field
DocType
series-parallel graph,recurrence template
Graph,Discrete mathematics,Combinatorics,Recurrence relation,Linear algorithm,Series and parallel circuits,Mathematics,Maximal independent set
Journal
Volume
Issue
ISSN
54
2-3
Discrete Applied Mathematics
Citations 
PageRank 
References 
5
0.64
8
Authors
2
Name
Order
Citations
PageRank
Dana L. Grinstead1332.93
Peter J. Slater2593132.02