A recurrence template for several parameters in series-parallel graphs

DOI10.1016/0166-218X(94)90020-5zbMath0812.68099MaRDI QIDQ1336624

Dana L. Grinstead, Peter J. Slater

Publication date: 3 November 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

recurrence relationsrecurrence parameters

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (8)

On the efficiency index of a graph ⋮ A recurrence template for several parameters in series-parallel graphs ⋮ MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS ⋮ Coefficient of domination in graph ⋮ Efficient sets in graphs ⋮ Small \(k\)-pyramids and the complexity of determining \(k\) ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Efficient edge domination problems in graphs

Cites Work

• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Relations between packing and covering numbers of a tree
• A recurrence template for several parameters in series-parallel graphs
• A linear algorithm for the domination number of a series-parallel graph
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• A Best Possible Heuristic for the k-Center Problem
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
• The Recognition of Series Parallel Digraphs
• Linear-time computability of combinatorial problems on series-parallel graphs
• MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A recurrence template for several parameters in series-parallel graphs