{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:11:27Z","timestamp":1725898287989},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340406"},{"type":"electronic","value":"9783642340413"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34041-3_109","type":"book-chapter","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T05:19:34Z","timestamp":1346995174000},"page":"791-796","source":"Crossref","is-referenced-by-count":1,"title":["The Algorithmic Complexity of Reverse Signed Domination in Graphs"],"prefix":"10.1007","author":[{"given":"Wensheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongsheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifang","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaming","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejing","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"109_CR1","volume-title":"Graphs and Digraphs","author":"G. Chartrand","year":"1986","unstructured":"Chartrand, G., Lesniak, L.: Graphs and Digraphs, 2nd edn. Wadsworth and Brooks Cole, Monterey (1986)","edition":"2"},{"key":"109_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1038\/nrg1272","volume":"5","author":"A.L. Barab\u00e0si","year":"2004","unstructured":"Barab\u00e0si, A.L., Oltvai, Z.N.: Network biology: understanding the cells functional organization. Nature Reviews Genetics\u00a05, 101\u2013113 (2004)","journal-title":"Nature Reviews Genetics"},{"key":"109_CR3","first-page":"67","volume":"194","author":"M. Dehmer","year":"2006","unstructured":"Dehmer, M., Emmert-Streib, F.: Structural Similarity of Directed Universal Hierarchical Graphs: A Low Computational Complexity Approach. Apllied Mathematics and Coputation\u00a0194, 67\u201374 (2006)","journal-title":"Apllied Mathematics and Coputation"},{"key":"109_CR4","first-page":"311","volume":"1","author":"J.E. Dunbar","year":"1995","unstructured":"Dunbar, J.E., Hedetniemi, S.T., Henning, M.A., Slater, P.J.: Signed Domination in Graphs. Combinatorics, Graph Theory, Applications\u00a01, 311\u2013322 (1995)","journal-title":"Combinatorics, Graph Theory, Applications"},{"key":"109_CR5","first-page":"101","volume":"12","author":"J.H. Hattingh","year":"1995","unstructured":"Hattingh, J.H., Henning, M.A., Slater, P.J.: On the Algorithmic Complexity of Signed Domination in Graphs. Australas. J. Combin.\u00a012, 101\u2013112 (1995)","journal-title":"Australas. J. Combin."},{"key":"109_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0012-365X(96)00026-X","volume":"158","author":"O. Favaron","year":"1996","unstructured":"Favaron, O.: Signed Domination in Regular Graphs. Discrete Math.\u00a0158, 287\u2013293 (1996)","journal-title":"Discrete Math."},{"key":"109_CR7","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1016\/j.ipl.2009.08.002","volume":"109","author":"C.M. Lee","year":"2009","unstructured":"Lee, C.M.: On the complexity of signed and minus total domination in graphs. Information Processing Letters\u00a0109, 1177\u20131181 (2009)","journal-title":"Information Processing Letters"},{"key":"109_CR8","first-page":"15","volume":"98","author":"M.J. Gao","year":"2011","unstructured":"Gao, M.J., Shan, E.F.: The Signed Total Domination Number of Graphs. ARS Combinatoria\u00a098, 15\u201324 (2011)","journal-title":"ARS Combinatoria"},{"key":"109_CR9","first-page":"213","volume":"85","author":"H.C. Wang","year":"2011","unstructured":"Wang, H.C., Tong, J., Volkmann, L.: A Note on Signed Total 2-independence in Graphs. Utilitas Mathematica\u00a085, 213\u2013223 (2011)","journal-title":"Utilitas Mathematica"},{"key":"109_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1090\/conm\/531\/10455","volume":"531","author":"A.H. Berliner","year":"2010","unstructured":"Berliner, A.H., Brualdi, R.A., Deaett, L., Kiernan, K.P., Meyer, S.A., Schroeder, M.W.: Signed Domination of Graphs and (0,1)-Matrices. Combinatorics and Graphs\u00a0531, 19\u201342 (2010)","journal-title":"Combinatorics and Graphs"},{"key":"109_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.5486\/PMD.2011.4826","volume":"79","author":"M. Atapour","year":"2011","unstructured":"Atapour, M., Tabriz, S.M.S., Khodkar, A.: Global signed total domination in graphs. Publicaiones Maathematicae-Debrecen\u00a079, 7\u201322 (2011)","journal-title":"Publicaiones Maathematicae-Debrecen"},{"key":"109_CR12","unstructured":"Dewdney, A.K.: Fast Turing Reductions Between Problems in NP 4. Report 71, University of Western Ontario (1981)"}],"container-title":["Communications in Computer and Information Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34041-3_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:41:54Z","timestamp":1620132114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34041-3_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340406","9783642340413"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34041-3_109","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}