Teaching dynamic programming techniques using permutation graphs

Authors:
Y. Daniel Liang
Affiliations:
Department of Computer Science, Indiana Purdue University at Fort Wayne, Fort Wayne, IN
Venue:
SIGCSE '95 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
Year:
1995

Citing 11
Cited 0

On domination problems for permutation and other graphs

Theoretical Computer Science
Fast algorithms for the dominating set problem on permutation graphs

SIGAL '90 Proceedings of the international symposium on Algorithms
Algorithms in C

Algorithms in C
A new approach for the domination problem on permutation graphs

Information Processing Letters
Permutation graphs: connected domination and Steiner trees

Discrete Mathematics - Topics on domination
Connected domination and Steiner set on weighted permutation graphs

Information Processing Letters
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs

Information Processing Letters
On the feedback vertex set problem in permutation graphs

Information Processing Letters
Introduction to Algorithms: A Creative Approach

Introduction to Algorithms: A Creative Approach
An $O(N + M)$-Time Algorithm for Finding a Minimum-WeightDominating Set in a Permutation Graph

SIAM Journal on Computing
On Improved Time Bounds for Permutation Graph Problems

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic programming is one of important techniques in algorithm design. The permutation graph is a special type of graphs with theoretical significance and practical applications. Many graph problems such as the domination, and independent set problems can be solved efficiently using dynamic programming schemes by exploring the structural properties of permutation diagrams. Most of current algorithm textbooks use the knapsack problem and matrix chain product as examples for teaching this technique. This paper introduces an incremental and comprehensive approach to teaching dynamic programming using permutation graphs.