Entry Muller:1987:NCS 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{Muller:1987:NCS,
  author =       "H. Muller and A. Brandstadt",
  title =        "The {NP-completeness} of {Steiner} tree and dominating
                 set for chordal bipartite graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "53",
  number =       "2--3",
  pages =        "257--265",
  month =        "????",
  year =         "1987",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Sektion Math., Friedrich-Schiller-Univ., Jena, East
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "chordal bipartite graphs; computational complexity;
                 dominating set; graph theory; NP-completeness; Steiner
                 tree",
  pubcountry =   "Netherlands A06",
  treatment =    "T Theoretical or Mathematical",
}

Related entries