{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:36Z","timestamp":1759637976688,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_21","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"285-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Aspects of Disjunctive Total Domination in Graphs"],"prefix":"10.1007","author":[{"given":"Chin-Fu","family":"Lin","sequence":"first","affiliation":[]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11, 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","volume":"22","author":"GJ Chang","year":"1988","unstructured":"Chang, G.J.: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Appl. Math. 22, 21\u201334 (1988)","journal-title":"Discrete Appl. Math."},{"key":"21_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.2989\/16073606.2014.894688","volume":"37","author":"W Goddard","year":"2014","unstructured":"Goddard, W., Henning, M.A., McPillan, C.A.: The disjunctive domination number of a graph. Quaestiones Math. 37, 547\u2013561 (2014)","journal-title":"Quaestiones Math."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/1097-0118(200009)35:1<21::AID-JGT3>3.0.CO;2-F","volume":"35","author":"MA Henning","year":"2000","unstructured":"Henning, M.A.: Graphs with large total domination number. J. Graph Theor. 35, 21\u201345 (2000)","journal-title":"J. Graph Theor."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning, M.A.: A survey of selected recent results on total domination in graphs. Discrete Math. 309, 32\u201363 (2009)","journal-title":"Discrete Math."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.dam.2014.10.036","volume":"184","author":"MA Henning","year":"2015","unstructured":"Henning, M.A., Marcon, S.A.: Domination versus disjunctive domination in trees. Discrete Appl. Math. 184, 171\u2013177 (2015)","journal-title":"Discrete Appl. Math."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2989\/16073606.2015.1068237","volume":"39","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Marcon, S.A.: Domination versus disjunctive domination in graphs. Quaestiones Math. 39, 261\u2013273 (2016)","journal-title":"Quaestiones Math."},{"key":"21_CR9","first-page":"255","volume":"17","author":"MA Henning","year":"2015","unstructured":"Henning, M.A., Naicker, V.: Graphs with large disjunctive total domination number. Discrete Math. Theor. Comput. Sci. 17, 255\u2013282 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.7151\/dmgt.1854","volume":"36","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Naicker, V.: Bounds on the disjunctive total domination number of a tree. Discussiones Math. Graph Theor. 36, 153\u2013171 (2016)","journal-title":"Discussiones Math. Graph Theor."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1007\/s10878-014-9811-4","volume":"31","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Naicker, V.: Disjunctive total domination in graphs. J. Comb. Optim. 31, 1090\u20131110 (2016)","journal-title":"J. Comb. Optim."},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2013). ISBN:978-1-4614-6525-6"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0166-218X(93)90178-Q","volume":"42","author":"JM Keil","year":"1993","unstructured":"Keil, J.M.: The complexity of domination problems in circle graphs. Discrete Appl. Math. 42, 51\u201363 (1993)","journal-title":"Discrete Appl. Math."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1080\/10556788.2014.895828","volume":"30","author":"P Kov\u00e1cs","year":"2015","unstructured":"Kov\u00e1cs, P.: Minimum-cost flow algorithms: an experimental evaluation. Optim. Methods Softw. 30, 94\u2013127 (2015)","journal-title":"Optim. Methods Softw."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0020-0190(97)00115-4","volume":"63","author":"D Kratsch","year":"1997","unstructured":"Kratsch, D., Stewart, L.: Total domination and transformation. Inf. Process. Lett. 63, 167\u2013170 (1997)","journal-title":"Inf. Process. Lett."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1137\/0605040","volume":"5","author":"R Laskar","year":"1984","unstructured":"Laskar, R., Pfaff, J., Hedetniemi, S.M., Hedetneimi, S.T.: On the algorithmic complexity of total domination. SIAM. J. Algebraic Discrete Methods 5, 420\u2013425 (1984)","journal-title":"SIAM. J. Algebraic Discrete Methods"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller, H., Brandst\u00e4dt, A.: The NP-completeness of steiner tree and dominating set for chordal bipartite graphs. Theor. Comput. Sci. 53, 257\u2013265 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41, 338\u2013350 (1993)","journal-title":"Oper. Res."},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-21398-9_26","volume-title":"Computing and Combinatorics","author":"BS Panda","year":"2015","unstructured":"Panda, B.S., Pandey, A., Paul, S.: Algorithmic aspects of disjunctive domination in graphs. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 325\u2013336. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-21398-9_26"},{"key":"21_CR20","unstructured":"Pfaff, J., Laskar, R.C., Hedetniemi, S.T.: NP-completeness of total and connected domination and irredundance for bipartite graphs. Technical report 428, Clemson University. Dept. Math. Sciences (1983)"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(88)90076-2","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam, G., Pandu Rangan, C.: Total domination in interval graphs revisited. Inf. Process. Lett. 27, 17\u201321 (1988)","journal-title":"Inf. Process. Lett."},{"key":"21_CR22","first-page":"157","volume":"1","author":"JA Telle","year":"1994","unstructured":"Telle, J.A.: Complexity of domination-type problems in graphs. Nord. J. Comput. 1, 157\u2013171 (1994)","journal-title":"Nord. J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:19:07Z","timestamp":1558477147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/cocoa2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}