Entry Megiddo:1988:FMD from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Megiddo:1988:FMD,
  author =       "Nimrod Megiddo and Uzi Vishkin",
  title =        "On finding a minimum dominating set in a tournament",
  journal =      j-THEOR-COMP-SCI,
  volume =       "61",
  number =       "2--3",
  pages =        "307--316",
  month =        nov,
  year =         "1988",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  affiliationaddress = "San Jose, CA, USA",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "IBM Almaden Res. Center, San Jose, CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "Algorithms; Boolean Formulas; boolean formulas;
                 Computer Programming; conjunctive normal form; directed
                 graph; directed graphs; Mathematical Techniques--Set
                 Theory; Minimum Dominating Set; minimum dominating set;
                 polynomial-time algorithm; Polynomial-Time Algorithm;
                 polynomial-time algorithm; Satisfiability Problem;
                 satisfiability problem; tournament; Tournament",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries