Work

Teaching dynamic programming techniques using permutation graphs

Year: 1995

Type: conference-paper

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.

Source: ACM Technical Symposium on Computer Science Education (SIGCSE)

DOI: 10.1145/199688.199721

Author: Y. Daniel Liang

Institution: Indiana University – Purdue University Fort Wayne

Language: English

Topic: Teaching and Learning Programming

Subfield: Computer Science Applications

Field: Computer Science

Domain: Physical Sciences

SDG: Quality education

Open Access status: bronze

OpenAlex ID: W1975615100

FWCI:

Cites: 19

Cited by: 2

Related to: 10