{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:26Z","timestamp":1759637546670},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,15]],"date-time":"2014-03-15T00:00:00Z","timestamp":1394841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10878-014-9729-x","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T01:04:23Z","timestamp":1395104663000},"page":"247-256","source":"Crossref","is-referenced-by-count":10,"title":["Tractable connected domination for restricted bipartite graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Tian","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,15]]},"reference":[{"key":"9729_CR1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/s10878-011-9427-x","volume":"26","author":"MH Akhbari","year":"2013","unstructured":"Akhbari MH, Hasni R, Favaron O, Karami H, Sheikholeslami SM (2013) On the outer-connected domination in graphs. J Comb Optim 26:10\u201318","journal-title":"J Comb Optim"},{"issue":"5","key":"9729_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke P, M\u00fcller H, Kratsch D (1990) Domination in convex and chordal bipartite graphs. Inf Process Lett 36(5):231\u2013236","journal-title":"Inf Process Lett"},{"key":"9729_CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10878-010-9358-y","volume":"23","author":"H Du","year":"2012","unstructured":"Du H, Wu W, Shan S, Kim D, Lee W (2012) Constructing weakly connected dominating set for secure clustering in distributed sensor network. J Comb Optim 23:301\u2013307","journal-title":"J Comb Optim"},{"key":"9729_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H.Freeman and Company, New York"},{"key":"9729_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F Grover","year":"1967","unstructured":"Grover F (1967) Maximum matching in a convex bipartite graph. Nav Res Logist Q 14:313\u2013316","journal-title":"Nav Res Logist Q"},{"key":"9729_CR6","doi-asserted-by":"crossref","unstructured":"Jiang W, Liu T, Ren TN, Xu K (2011a) Two hardness results on feedback vertex sets. In: Proceedings of of FAW-AAIM, pp 233\u2013243","DOI":"10.1007\/978-3-642-21204-8_26"},{"issue":"7","key":"9729_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.tcs.2012.12.021","volume":"507","author":"W Jiang","year":"2013","unstructured":"Jiang W, Liu T, Wang C, Xu K (2013) Feedback vertex sets on restricted bipartite graphs. Theor Comput Sci 507(7):41\u201351","journal-title":"Theor Comput Sci"},{"key":"9729_CR8","doi-asserted-by":"crossref","unstructured":"Jiang W, Liu T, Xu K (2011b) Tractable feedback vertex sets in restricted bipartite graphs. In: Proceedings of COCOA, pp 424\u2013434","DOI":"10.1007\/978-3-642-22616-8_33"},{"key":"9729_CR9","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/s10878-010-9346-2","volume":"23","author":"Y Li","year":"2012","unstructured":"Li Y, Wu Y, Ai C, Beyah R (2012) On the construction of $$k$$ k -connected $$m$$ m -dominating sets in wireless networks. J Comb Optim 23:118\u2013139","journal-title":"J Comb Optim"},{"key":"9729_CR10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(95)00145-3","volume":"56","author":"YD Liang","year":"1995","unstructured":"Liang YD, Blum N (1995) Circular convex bipartite graphs: maximum matching and Hamiltonian circuits. Inf Process Lett 56:215\u2013219","journal-title":"Inf Process Lett"},{"key":"9729_CR11","doi-asserted-by":"crossref","unstructured":"Lu M, Liu T, Xu K (2013a) Independent domination: reductions from circular- and triad-convex bipartite graphs to convex bipartite graphs. In: Proceedings of FAW-AAIM, pp 142\u2013152","DOI":"10.1007\/978-3-642-38756-2_16"},{"key":"9729_CR12","doi-asserted-by":"crossref","unstructured":"Lu Z, Liu T, Xu K (2013b) Tractable connected domination for restricted bipartite graphs (Extended Abstract). In: Proceedings of COCOON, pp 721\u2013728","DOI":"10.1007\/978-3-642-38768-5_65"},{"key":"9729_CR13","doi-asserted-by":"crossref","unstructured":"Lu Z, Lu M, Liu T, Xu K (2013c) Circular convex bipartite graphs: feedback vertex set. In: Proceedings of COCOA, pp 272\u2013283","DOI":"10.1007\/978-3-319-03780-6_24"},{"issue":"2\u20133","key":"9729_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller H, Brandst\u00e4t A (1987) The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theor Comput Sci 53(2\u20133):257\u2013265","journal-title":"Theor Comput Sci"},{"key":"9729_CR15","unstructured":"Pfaff J, Laskar R, Hedetniemi ST (1983) NP-completeness of total and connected domination, and irredundance for bipartite graphs. Technical Report 428, Department of Mathematical Sciences, Clemenson University"},{"issue":"6","key":"9729_CR16","first-page":"607","volume":"13","author":"E Sampathkumar","year":"1979","unstructured":"Sampathkumar E, Walikar HB (1979) The connected domination number of a graph. Math Phys Sci 13(6):607\u2013613","journal-title":"Math Phys Sci"},{"key":"9729_CR17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10878-007-9124-y","volume":"16","author":"W Shang","year":"2008","unstructured":"Shang W, Yao F, Wan P, Hu X (2008) On minimum $$m$$ m -connected $$k$$ k -dominating set problem in unit disc graphs. J Comb Optim 16:99\u2013106","journal-title":"J Comb Optim"},{"key":"9729_CR18","doi-asserted-by":"crossref","unstructured":"Song Y, Liu T, Xu K (2012) Independent domination on tree convex bipartite graphs. In: Proceedings of FAW-AAIM, pp 129\u2013138","DOI":"10.1007\/978-3-642-29700-7_12"},{"key":"9729_CR19","doi-asserted-by":"crossref","unstructured":"Wang C, Liu T, Jiang W, Xu K (2012) Feedback vertex sets on tree convex bipartite graphs. In: Proceedings of COCOA, pp 95\u2013102","DOI":"10.1007\/978-3-642-31770-5_9"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9729-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9729-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9729-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T11:02:59Z","timestamp":1565262179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9729-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,15]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9729"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9729-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,15]]}}}