@inproceedings{d7a050056791432bb2a22b15c0f9ab9e,
title = "Teaching dynamic programming techniques using permutation graphs",
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.",
keywords = "Algorithm, Dynamic programming, Permutation graph",
author = "Liang, {Y. Daniel}",
note = "Publisher Copyright: {\textcopyright} 1995 ACM.; 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995 ; Conference date: 02-03-1995 Through 04-03-1995",
year = "1995",
month = mar,
day = "15",
doi = "10.1145/199688.199721",
language = "English",
series = "Proceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995",
publisher = "Association for Computing Machinery, Inc",
pages = "56--60",
editor = "Miller, {James E.} and White, {Curt M.} and Judy Gersting and White, {Curt M.}",
booktitle = "Proceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 1995",
}