Entry Kloks:1997:TMF 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{Kloks:1997:TMF,
  author =       "Ton Kloks and Dieter Kratsch and Jeremy Spinrad",
  title =        "On treewidth and minimum fill-in of asteroidal
                 triple-free graphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "175",
  number =       "2",
  pages =        "309--335",
  day =          "10",
  month =        apr,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:46 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=175&issue=2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=175&issue=2&aid=2408",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240C
                 (Computational complexity)",
  corpsource =   "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
                 Technol., Netherlands",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "asteroidal triple-free graphs; bounded dimension;
                 cocomparability graphs; computational complexity; graph
                 problems; graph theory; minimal separators; minimum
                 fill-in; minimum interval; NP-complete; pathwidth;
                 polynomial time algorithms; treewidth",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries