{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:35:40Z","timestamp":1720200940232},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T00:00:00Z","timestamp":1632009600000},"content-version":"vor","delay-in-days":1479,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1016\/j.tcs.2017.06.022","type":"journal-article","created":{"date-parts":[[2017,7,8]],"date-time":"2017-07-08T08:46:10Z","timestamp":1499503570000},"page":"34-41","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Dominator sequences in bipartite graphs"],"prefix":"10.1016","volume":"694","author":[{"given":"B.","family":"Jayaram","sequence":"first","affiliation":[]},{"given":"S.","family":"Arumugam","sequence":"additional","affiliation":[]},{"given":"K.","family":"Thulasiraman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2017.06.022_br0010","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.procs.2015.12.073","article-title":"Independent dominator sequence number of a graph","volume":"74","author":"Arumugam","year":"2015","journal-title":"Proc. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.06.022_br0020","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.disc.2014.07.016","article-title":"Dominating sequence in graphs","volume":"336","author":"Bre\u0161ar","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2017.06.022_br0030","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1137\/100786800","article-title":"Domination game and the imagination strategy","volume":"24","author":"Bre\u0161ar","year":"2000","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2017.06.022_br0040","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"issue":"7","key":"10.1016\/j.tcs.2017.06.022_br0050","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/26.153361","article-title":"Lightpath communications: an approach to high bandwidth optical WDM","volume":"40","author":"Chlamtac","year":"1992","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.tcs.2017.06.022_br0060","first-page":"5","article-title":"A bipartite theory of graphs: I","volume":"55","author":"Hedetniemi","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/j.tcs.2017.06.022_br0070","first-page":"137","article-title":"A bipartite theory of graphs: II","volume":"64","author":"Hedetniemi","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/j.tcs.2017.06.022_br0080","unstructured":"B. Jayaram, S. Arumugam, K. Thulasiraman, Dominator Sequences in Trees, GATR Conference (submitted for publication)."},{"key":"10.1016\/j.tcs.2017.06.022_br0100","article-title":"Survivable mapping algorithm by ring trimming(SMART) for large IP-over-WDM networks","author":"Kurant","year":"2004","journal-title":"BroadNets"},{"key":"10.1016\/j.tcs.2017.06.022_br0110","series-title":"Graphs, Networks and Algorithms","author":"Swamy","year":"1981"},{"key":"10.1016\/j.tcs.2017.06.022_br0120","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1109\/JSAC.2002.1003045","article-title":"Survivable lightpath routing: a new approach to the design of WDM-based networks","volume":"20","author":"Modiano","year":"2002","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.tcs.2017.06.022_br0130","first-page":"1026","article-title":"Circuits\/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks","volume":"2009","author":"Thulasiraman","year":"2009","journal-title":"Proc. - IEEE INFOCOM"},{"key":"10.1016\/j.tcs.2017.06.022_br0140","series-title":"Proceedings of the 2nd International Conference on COMmunication Systems and NETworks","first-page":"128","article-title":"Primal meets dual: a generalized theory of logical topology survivability in IP-over-WDM optical networks","author":"Thulasiraman","year":"2010"},{"key":"10.1016\/j.tcs.2017.06.022_br0150","series-title":"Optical Network, Proceedings of the International Conference on COMmunication Systems and NETworks","first-page":"1","article-title":"Robustness of logical topology mapping algorithms for survivability against multiple failures in an IP-over-WDM","author":"Thulasiraman","year":"2012"},{"key":"10.1016\/j.tcs.2017.06.022_br0160","series-title":"Introduction to Graph Theory","author":"West","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517305340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517305340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T01:00:53Z","timestamp":1632013253000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397517305340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":15,"alternative-id":["S0304397517305340"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.06.022","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2017,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dominator sequences in bipartite graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.06.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}