Entry Anonymous:1977:DFD from sigcse1970.bib

Last update: Sun Apr 22 02:03:34 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{Anonymous:1977:DFD,
  author =       "Anonymous",
  title =        "Depth-first digraph algorithms without recursion",
  journal =      j-SIGCSE,
  volume =       "9",
  number =       "1",
  pages =        "151--153",
  month =        feb,
  year =         "1977",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/382063.803379",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sun Nov 18 08:53:56 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib",
  note =         "Special issue for the Seventh Technical Symposium on
                 Computer Science Education.",
  abstract =     "After having taught the design of algorithms for more
                 than ten years I still find that recursive algorithms
                 are much too difficult for most computer science
                 students. There seem to be two problems: the students
                 are unable to grasp the essence of an algorithm in a
                 recursive setting, and they rarely have any knowledge
                 of the mechanisms underlying recursive calls. In view
                 of the above it was thought useful to translate a
                 number of recursive algorithms into nonrecursive form
                 for classroom use. Tarjan's depth-first search
                 algorithms for digraphs (4,5) were selected because
                 they are sufficiently important to require their study
                 in some computer science course or other. The
                 translation consists of making the depth-first search
                 tree of the digraph explicit, and letting tree
                 traversals take over the role of recursion. The
                 nonrecursive algorithm for topological ordering of an
                 acyclic digraph will be our example here. This
                 algorithm is used to preprocess a scheduling network
                 before it is subjected to critical path analysis.",
  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