Entry Drewes:1993:RCH from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Drewes:1993:RCH,
  author =       "Frank Drewes",
  title =        "Recognising $k$-connected hypergraphs in cubic time",
  journal =      j-THEOR-COMP-SCI,
  volume =       "109",
  number =       "1--2",
  pages =        "83--122",
  day =          "01",
  month =        mar,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:00 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=109&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=109&issue=1-2&aid=1258",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  conflocation = "Bordeaux, France; 21-23 March 1991",
  conftitle =    "International Workshop on Computing by Graph
                 Transformation",
  corpsource =   "Bremen Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; cubic time; cyclically
                 connected graphs; decidability; decidable; formal
                 languages; grammars; graph theory;
                 hyperedge-replacement grammars; hypergraph languages;
                 membership problem; split trees; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries