Entry Liang:1995:TDP from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Liang:1995:TDP,
  author =       "Y. Daniel Liang",
  title =        "Teaching dynamic programming techniques using
                 permutation graphs",
  journal =      j-SIGCSE,
  volume =       "27",
  number =       "1",
  pages =        "56--60",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/199691.199721",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:28 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  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.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries