Entry Monien:1988:MCN 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{Monien:1988:MCN,
  author =       "B. Monien and I. H. Sudborough",
  title =        "{Min Cut} is {NP}-complete for edge weighted trees",
  journal =      j-THEOR-COMP-SCI,
  volume =       "58",
  number =       "1-3",
  pages =        "209--229",
  month =        jun,
  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 =  "Univ Paderborn",
  affiliationaddress = "Paderborn, West Ger",
  classification = "723; 921; B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  conference =   "Thirteenth International Colloquium on Automata,
                 Languages and Programming",
  conflocation = "Rennes, France; 15-19 July 1986",
  conftitle =    "Thirteenth International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Fachbereich Math. und Inf., Paderborn Univ., West
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "Complexity; Computer Metatheory; Edge Weighted Trees;
                 edge weighted trees; graph theory; Mathematical
                 Techniques; Min Cut Linear Arrangement Problem;
                 NP-complete; np-completeness; planar graphs; polynomial
                 size edge weights; progressive black white pebble
                 demand; search number; topological bandwidth; Trees;
                 trees (mathematics); vertex separation",
  meetingaddress = "Rennes, Fr",
  meetingdate =  "Jul 1986",
  meetingdate2 = "07/86",
  pubcountry =   "Netherlands",
  sponsororg =   "Eur. Assoc. Theor. Comput. Sci",
  treatment =    "T Theoretical or Mathematical",
}

Related entries