{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:51Z","timestamp":1761620751001},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0020-0190(95)94093-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"165-171","source":"Crossref","is-referenced-by-count":32,"title":["Edge domination on bipartite permutation graphs and cotriangulated graphs"],"prefix":"10.1016","volume":"56","author":[{"given":"Anand","family":"Srinivasan","sequence":"first","affiliation":[]},{"given":"K.","family":"Madhukar","sequence":"additional","affiliation":[]},{"given":"P.","family":"Nagavamsi","sequence":"additional","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]},{"given":"Maw-Shang","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)94093-8_BIB1","article-title":"Efficient Algorithms for the weighted domination problems on trapezoid graphs","author":"Srinivasan","year":"1994"},{"key":"10.1016\/0020-0190(95)94093-8_BIB2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(90)90357-N","article-title":"Dominating sets in perfect graphs","volume":"86","author":"Corneil","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(95)94093-8_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","article-title":"Domination in convex and chordal bipartite graphs","volume":"36","author":"Damaschke","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)94093-8_BIB4","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0020-0190(95)94093-8_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(95)94093-8_BIB6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0406030","article-title":"Minimum edge dominating sets","volume":"6","author":"Horton","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(95)94093-8_BIB7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1006","article-title":"The edge domination problem","volume":"15","author":"Hwang","year":"1995","journal-title":"Discuss. Math. \u2014 Graph Theory"},{"key":"10.1016\/0020-0190(95)94093-8_BIB8","series-title":"Proc. 21st Ann. Symp. on the Foundations of Computer Science","first-page":"17","article-title":"An O(\u221a\u00a6v\u00a6 \u00b7 \u00a6E\u00a6) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0020-0190(95)94093-8_BIB9","series-title":"Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing","article-title":"Edge domination in trees","author":"Mitchell","year":"1977"},{"key":"10.1016\/0020-0190(95)94093-8_BIB10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(95)94093-8_BIB11","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","article-title":"Edge domination sets in graphs","volume":"38","author":"Yannakakis","year":"1980","journal-title":"SIAM J. Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095940938?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095940938?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T13:51:54Z","timestamp":1556286714000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095940938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["0020019095940938"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)94093-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}