Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Chen:2012:NCA, author = "Lei Chen and Weiming Zeng and Changhong Lu", title = "{NP}-completeness and {APX}-completeness of restrained domination in graphs", journal = j-THEOR-COMP-SCI, volume = "448", number = "1", pages = "1--8", day = "24", month = aug, year = "2012", CODEN = "TCSCDI", DOI = "https://doi.org/10.1016/j.tcs.2012.05.005", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Jun 30 13:07:21 MDT 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397512004264", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }