Entry Kooshesh:1995:SPU 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{Kooshesh:1995:SPU,
  author =       "Ali A. Kooshesh",
  title =        "Solving a problem using cooperating data structures",
  journal =      j-SIGCSE,
  volume =       "27",
  number =       "1",
  pages =        "61--65",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/199691.199724",
  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 =     "In this write-up, we describe series parallel graphs,
                 a simple class of general graphs, and show how to
                 compute their minimum spanning tree or shortest path.
                 The problem is intended to be used as an assignment in
                 an undergraduate course on Data Structures. It is a
                 simple problem, yet non-trivial, and allows the
                 students to implement several interesting data
                 structures in one programming assignment.",
  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