{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:41Z","timestamp":1725490241473},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_21","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:17:32Z","timestamp":1188335852000},"page":"241-253","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Minus and Signed Domination in Graphs"],"prefix":"10.1007","author":[{"given":"Chin Lung","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(95)00094-D","volume":"159","author":"D.W. Bange","year":"1996","unstructured":"D.W. Bange, A.E. Barkauskas, L.H. Host, and P.J. Slater, Generalized dominationand efficient domination in graphs, Discrete Mathematics, 159 (1996) 1\u201311.","journal-title":"Discrete Mathematics"},{"key":"21_CR2","unstructured":"D.W. Bange, A. Barkauskas, and P.J. Slater, Efficient dominating sets in graphs,in: R.D. Ringeisen and F.S. Roberts eds., Application of Discrete Mathematics,(SIAM, Philadelphia, PA, 1988) 189\u2013199."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.B. Le, and J.P. Spinrad, Graph Classes\u2014A Survey, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(94)00067-3","volume":"63","author":"G.J. Chang","year":"1995","unstructured":"G.J. Chang, C. Pandu Rangan, and S.R. Coorg, Weighted independent perfectdomination on cocomparability graphs, Discrete Applied Mathematics, 63 (1995)215\u2013222.","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR5","first-page":"135","volume":"80","author":"M.S. Chang","year":"1997","unstructured":"M.S. Chang, Weighted domination of cocomparability graphs, Discrete AppliedMathematics, 80 (1997) 135\u2013148.","journal-title":"Discrete AppliedMathematics"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90147-2","volume":"48","author":"M.S. Chang","year":"1993","unstructured":"M.S. Chang and Y.C. Liu, Polynomial algorithm for the weighted perfect domina-tion problems on chordal graphs and split graphs, Information Processing Letters,48 (1993) 205\u2013210.","journal-title":"Information Processing Letters"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/10692760_2","volume-title":"Minus domination in small-degree graphs","author":"P. Damaschke","year":"1998","unstructured":"P. Damaschke, Minus domination in small-degree graphs, in: Proceedings of the24th International Workshop on Graph-Theoretic Concepts in Computer Science,Lecture Notes in Computer Science, 1517 (1998) 17\u201325."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0166-218X(95)00056-W","volume":"68","author":"J. Dunbar","year":"1996","unstructured":"J. Dunbar, W. Goddar, S. Hedetniemi, A. McRae, and M.A. Henning, The algo-rithmic complexity of minus domination in graphs, Discrete Applied Mathematics,68 (1996) 73\u201384.","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR9","unstructured":"J. Dunbar, S.T. Hedetniemi, M.A. Henning, and P.J. Slater, Signed domination ingraphs, in: Y. Alari and A. Schwenk, eds., Proc. 7th International Conference onthe Theory and Applications of Graphs, (Wiley, New York, 1995) 311\u2013321."},{"key":"21_CR10","first-page":"141","volume":"3","author":"M.R. Fellows","year":"1991","unstructured":"M.R. Fellows and M.N. Hoover, Perfect domination, Australasian Journal of Com-binatorics, 3 (1991) 141\u2013150.","journal-title":"Australasian Journal of Com-binatorics"},{"key":"21_CR11","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability \u2014 A Guide to theTheory of NP-Completeness, San Francisco, Freeman, 1979."},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P.C. Gilmore","year":"1964","unstructured":"P.C. Gilmore and A.J. Hoffman, A characterization of comparability graphs andof interval graphs, Canadian Journal of Mathematics, 16 (1964) 539\u2013548.","journal-title":"Canadian Journal of Mathematics"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press,New York, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"21_CR14","first-page":"101","volume":"12","author":"J.H. Hattingh","year":"1995","unstructured":"J.H. Hattingh, M.A. Henning, and P.J. Slater, The algorithmic complexity of signeddomination in graphs, Australasian Journal of Combinatorics, 12 (1995) 101\u2013112.","journal-title":"Australasian Journal of Combinatorics"},{"key":"21_CR15","unstructured":"T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination inGraphs, Marcel Dekker, New York, 1998."},{"key":"21_CR16","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, andComputation, Addison-Wesley, Reading, MA, 1979."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Y.D. Liang, C.L. Lu, and C.Y. Tang, Efficient domination on permutation graphsand trapezoid graphs, in: T. Jiang and D.T. Lee, eds., Proc. 3rd Annual Interna-tional Computing and Combinatorics Conference (COCOON\u201997), Lecture Notesin Computer Science, 1276 (Springer-Verlag, 1997) 232\u2013241.","DOI":"10.1007\/BFb0045090"},{"key":"21_CR18","unstructured":"C.L. Lu, On the Study of Weighted Efficient Domination, PhD Thesis, Departmentof Computer Science, National Tsing Hua University, Taiwan, 1998."},{"key":"21_CR19","unstructured":"C.C. Yen,Algorithmic Aspects of Perfect Domination, PhD Thesis, Department ofComputer Science, National Tsing Hua University, Taiwan, 1992."},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0166-218X(94)00138-4","volume":"66","author":"C.C. Yen","year":"1996","unstructured":"C.C. Yen and R.C.T. Lee, The weighted perfect domination problem and its vari-ants, Discrete Applied Mathematics, 66 (1996) 147\u2013160.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:26:07Z","timestamp":1556803567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}