Entry Hershberger:1994:DST 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{Hershberger:1994:DST,
  author =       "John Hershberger and Monika Rauch and Subhash Suri",
  title =        "Data structures for two-edge connectivity in planar
                 graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "130",
  number =       "1",
  pages =        "139--161",
  day =          "01",
  month =        aug,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:17 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=130&issue=1;
                 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=1994&volume=130&issue=1&aid=1641",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory); C4260
                 (Computational geometry); C6120 (File organisation)",
  corpsource =   "Syst. Res. Center, Digital Equipment Corp., Palo Alto,
                 CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; computational geometry; data
                 structures; embedded planar graph; graph theory; online
                 updates; planar graphs; query; spatial data structures;
                 time complexity; two-edge connectivity",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries