{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:37:46Z","timestamp":1725496666150},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_13","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T09:37:43Z","timestamp":1196329063000},"page":"126-136","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs"],"prefix":"10.1007","author":[{"given":"Yaw-Ling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang Rong","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin-Te","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Andreas Brandst\u00e4dt, Van Bang Le, and Jeremy P. Spinrad. Graph Classes: A Survey. SIAM monographs on discrete mathematics and applications, Philadelphia, P. A., 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(97)80001-7","volume":"80","author":"M.-S. Chang","year":"1997","unstructured":"M.-S. Chang. Weighted domination of cocomparability graphs. Discr. Applied Math., 80:135\u2013148, 1997.","journal-title":"Discr. Applied Math."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","volume":"21","author":"I. Dagan","year":"1988","unstructured":"I. Dagan, M.C. Golumbic, and R.Y. Pinter. Trapezoid graphs and their coloring. Discr. Applied Math., 21:35\u201346, 1988.","journal-title":"Discr. Applied Math."},{"key":"13_CR4","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"T.W. Haynes, S.T. Hedetniemi, and P.J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, Inc., N. Y., 1998."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0166-218X(99)00127-4","volume":"99","author":"E. Kohler","year":"2000","unstructured":"E. Kohler. Connected domination and dominating clique in trapezoid graphs. Discr. Applied Math., 99:91\u2013110, 2000.","journal-title":"Discr. Applied Math."},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D. Kratsch","year":"1993","unstructured":"D. Kratsch and L. K. Stewart. Domination on cocomparability graphs. SIAM J. Discrete Math., 6(3):400\u2013417, 1993.","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(95)00118-V","volume":"56","author":"Y. D. Liang","year":"1995","unstructured":"Y. D. Liang. Steiner set and connected domination in trapezoid graphs. Information Processing Letters, 56(2):101\u2013108, 1995.","journal-title":"Information Processing Letters"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Y. Daniel Liang. Dominations in trapezoid graphs. Information Processing Letters, 52(6):309\u2013315, December 1994.","DOI":"10.1016\/0020-0190(94)00159-6"},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-49381-6_29","volume-title":"ISAAC\u201998","author":"Y.-L. Lin","year":"1998","unstructured":"Yaw-Ling Lin. Fast algorithms for independent domination and efficient domination in trapezoid graphs. In ISAAC\u201998, LNCS 1533, pages 267\u2013276, Taejon, Korea, December 1998. Springer-Verlag."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1994.1034","volume":"17","author":"T.-H. Ma","year":"1994","unstructured":"T.-H. Ma and J.P. Spinrad. On the 2-chain subgraph cover and related problems. J. Algorithms, 17:251\u2013268, 1994.","journal-title":"J. Algorithms"},{"key":"13_CR11","unstructured":"Anand Srinivasan, M.S. Chang, K. Madhukar, and C. Pandu Rangan. Efficient algorithms for the weighted domination problems on trapezoid graphs. Manuscript, 1996."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80\u201382, 1977.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T08:17:03Z","timestamp":1557044223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}