Entry Marchetti-Spaccamela:1983:LTR from tcs1980.bib

Last update: Thu Sep 27 02:46:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | 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{Marchetti-Spaccamela:1983:LTR,
  author =       "A. Marchetti-Spaccamela and M. Prtasi",
  title =        "The largest tree in a random graph",
  journal =      j-THEOR-COMP-SCI,
  volume =       "23",
  number =       "3",
  pages =        "273--286",
  month =        may,
  year =         "1983",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); B0290F
                 (Interpolation and function approximation); C1160
                 (Combinatorial mathematics); C4130 (Interpolation and
                 function approximation)",
  corpsource =   "Instituto di Automatica, Univ. di Roma, Roma, Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "approximate greedy algorithms; approximation theory;
                 graph theory; largest tree; random graph; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries