Teaching dynamic programming techniques using permutation graphs
Published in ACM SIGCSE Bulletin • Mar 15, 1995
NobleIDNI8P41W47R59S00
Authors:
Yan Liang
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 program...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!