Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Yu:1998:CCS, author = "Chang-Wu Yu and Gen-Huey Chen and Tze-Heng Ma", title = "On the complexity of the $k$-chain subgraph cover problem", journal = j-THEOR-COMP-SCI, volume = "205", number = "1--2", pages = "85--98", day = "28", month = sep, year = "1998", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:22:05 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=205&issue=1-2; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/205/1-2/2572.pdf", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }