Entry Feuerstein:1993:DAS from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Feuerstein:1993:DAS,
  author =       "Esteban Feuerstein and Alberto Marchetti-Spaccamela",
  title =        "Dynamic algorithms for shortest paths in planar
                 graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "116",
  number =       "2",
  pages =        "359--371",
  day =          "16",
  month =        aug,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:28 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=116&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=116&issue=2&aid=1312",
  acknowledgement = ack-nhfb,
  classification = "C4260 (Computational geometry); C6120 (File
                 organisation)",
  corpsource =   "Dipartimento di Inf. and Sistemistica, Roma Univ.,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "arbitrary query node; computational geometry; data
                 structures; dynamic algorithms; dynamic version;
                 maximum flow problem; planar graphs; s-t planar
                 network; shortest paths; shortest-path tree; tree data
                 structures",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries