Entry Andreev:1998:PCA from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Andreev:1998:PCA,
  author =       "A. E. Andreev and A. Clementi and P. Crescenzi and E.
                 Dahlhaus and S. {De Agostino} and J. D. P. Rolim",
  title =        "The parallel complexity of approximating the high
                 degree subgraph problem",
  journal =      j-THEOR-COMP-SCI,
  volume =       "205",
  number =       "1--2",
  pages =        "261--282",
  day =          "28",
  month =        sep,
  year =         "1998",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:22:05 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=205&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/205/1-2/2811.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
}

Related entries