Entry Moran:1991:OCC 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{Moran:1991:OCC,
  author =       "S. Moran and Y. Wolfstahl",
  title =        "Optimal covering of cacti by vertex-disjoint paths",
  journal =      j-THEOR-COMP-SCI,
  volume =       "84",
  number =       "2",
  pages =        "179--197",
  day =          "29",
  month =        jul,
  year =         "1991",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Fac. of Comput. Sci., Technion, Israel Inst. of
                 Technol., Haifa, Israel",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "cacti; code optimization; computational complexity;
                 cubic 3-connected planar graphs; cycle; edge; graph
                 covering; graph theory; NP-complete; optimal covering
                 algorithm; parallel architectures; parallel programs;
                 path cover; smallest possible cardinality;
                 vertex-disjoint paths; vertices",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries