首页> 外文会议>SIGCSE technical symposium on Computer science education >Teaching dynamic programming techniques using permutation graphs
【24h】

Teaching dynamic programming techniques using permutation graphs

机译:使用置换图教授动态编程技术

获取原文

摘要

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.

机译:动态编程是算法设计中的重要技术之一。置换图是一种具有理论意义和实际应用的特殊类型的图。通过探索置换图的结构特性,可以使用动态编程方案有效地解决许多图形问题,例如控制问题和独立集问题。当前大多数算法教科书都以背包问题和矩阵链乘积为例来教授此技术。本文介绍了一种增量和综合的方法来使用置换图进行动态规划教学。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号