{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:11Z","timestamp":1725664151892},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_282","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:11:21Z","timestamp":1330261881000},"page":"506-514","source":"Crossref","is-referenced-by-count":7,"title":["Weighted independent perfect domination on cocomparability graphs"],"prefix":"10.1007","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]},{"given":"Satyan R.","family":"Coorg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"54_CR1","volume-title":"Technical Report TR-TCS-90-18","author":"K. Arvind","year":"1990","unstructured":"K. Arvind and C. Pandu Rangan, Efficient algorithms for domination problems on cocompaxability graphs, Technical Report TR-TCS-90-18 (1990), Department of Computer Science and Engineering, Indian Institute of Technology, Madras."},{"key":"54_CR2","first-page":"189","volume-title":"Applications of Discrete Mathematics","author":"D. W. Bange","year":"1988","unstructured":"D. W. Bange, A. E. Barkauskas, and P. T. Slater, Efficient dominating sets in graphs, Applications of Discrete Mathematics, R. D. Ringeisen and F. S. Roberts, eds., SIAM, Philad. (1988)189\u2013199."},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(86)90112-2","volume":"23","author":"A. A. Bertossi","year":"1986","unstructured":"A. A. Bertossi, Total domination in interval graphs, Inform. Processing Letters 23 (1986) 131\u2013134.","journal-title":"Inform. Processing Letters"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(88)90173-1","volume":"28","author":"A. A. Bertossi","year":"1988","unstructured":"A. A. Bertossi, On the domatic number of interval graph, Inform. Processing Letters 28 (1988) 275\u2013280.","journal-title":"Inform. Processing Letters"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/0401032","volume":"1","author":"A. A. Bertossi","year":"1988","unstructured":"A. A. Bertossi and A. Gori, Total domination and irredundance in weighted interval graphs, SIAM J. Disc. Math. 1 (1988) 317\u2013327.","journal-title":"SIAM J. Disc. Math."},{"key":"54_CR6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","volume":"B 15","author":"N. Biggs","year":"1973","unstructured":"N. Biggs, Perfect codes in graphs, J. Comb. Theory, Series B 15 (1973) 289\u2013296.","journal-title":"J. Comb. Theory, Series"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"M. S. Chang and Y. C. Liu, Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs, (1993) manuscript.","DOI":"10.1016\/0020-0190(93)90147-2"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"M. S. Chang and Y. C. Liu, Polynomial algorithms for the weighted perfect domination problems on interval graphs, (1993) manuscript.","DOI":"10.1016\/0020-0190(93)90147-2"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progression, Proceedings 19th Annual ACM Sysposium on Theory of Computing (1987) 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"54_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York (1980)."},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90022-0","volume":"22","author":"J. K. Keil","year":"1986","unstructured":"J. K. Keil, Total domination in interval graphs, Inform. Processing Letters 22 (1986) 171\u2013174.","journal-title":"Inform. Processing Letters"},{"key":"54_CR12","unstructured":"D. Kratsch and L. Stewart, Domination on cocomparability graphs, (1989), preprint."},{"key":"54_CR13","first-page":"187","volume":"79","author":"M. Livingston","year":"1990","unstructured":"M. Livingston and Q. F. Stout, Perfect dominating sets, Congressus Numerantium 79 (1990) 187\u2013203.","journal-title":"Congressus Numerantium"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/0403045","volume":"3","author":"T. L. Lu","year":"1990","unstructured":"T. L. Lu, P. H. Ho and G. J. Chang, The domatic number problem in interval graphs, SIAM J. Disc. Math. 3 (1990) 531\u2013536.","journal-title":"SIAM J. Disc. Math."},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(88)90076-2","volume":"27","author":"G. Ramalingam","year":"1988","unstructured":"G. Ramalingam and C. Pandu Rangan, Total domination in interval graphs revisited, Inform. Processing Letters 27 (1988) 17\u201321.","journal-title":"Inform. Processing Letters"},{"key":"54_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G. Ramalingam","year":"1988","unstructured":"G. Ramalingam and C. Pandu Rangan, A unified approach to domination problems on interval graphs, Inform. Processing Letters 27 (1988) 271\u2013274.","journal-title":"Inform. Processing Letters"},{"key":"54_CR17","doi-asserted-by":"crossref","unstructured":"J. Spinrad, Transitive orientation in (n 2) time, 15th STOC Proceedings (1983) 457\u2013466.","DOI":"10.1145\/800061.808777"},{"key":"54_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","volume":"33","author":"A. Srinivasa Rao","year":"1989\/90","unstructured":"A. Srinivasa Rao and C. Pandu Rangan, Linear algorithm for domatic number problem on interval graphs, Inform. Processing Letters 33 (1989\/90) 29\u201333.","journal-title":"Processing Letters"},{"key":"54_CR19","volume-title":"Ph. D thesis","author":"C. C. Yen","year":"1992","unstructured":"C. C. Yen, Algorithmic Aspects of Perfect Domination, Ph. D thesis, Institute of Information Science, National Tsing Hua University, Taiwan (1992)."},{"key":"54_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(90)90031-R","volume":"35","author":"C. C. Yen","year":"1990","unstructured":"C. C. Yen and R. C. T. Lee, The weighted perfect domination problem, Inform. Processing Letters 35 (1990) 295\u2013299.","journal-title":"Inform. Processing Letters"},{"key":"54_CR21","unstructured":"C. C. Yen and R. C. T. Lee, A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs, European J. Operational Research (1992), to appear."},{"key":"54_CR22","unstructured":"C. C. Yen and R. C. T. Lee, The weighted perfect domination problem and its variants, manuscript."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_282.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:17Z","timestamp":1605647597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_282","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}