{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T17:49:30Z","timestamp":1721411370417},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["140957\/2014-6","302578\/2014-5","303496\/2017-7"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1016\/j.cor.2019.07.004","type":"journal-article","created":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T06:19:06Z","timestamp":1563344346000},"page":"346-356","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["A new formulation for the Safe Set problem on graphs"],"prefix":"10.1016","volume":"111","author":[{"given":"Ana Flavia Uzeda","family":"Macambira","sequence":"first","affiliation":[]},{"given":"Luidi","family":"Simonetti","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8544-0181","authenticated-orcid":false,"given":"Hugo","family":"Barbalho","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0057-7670","authenticated-orcid":false,"given":"Pedro Henrique","family":"Gonzalez","sequence":"additional","affiliation":[]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2019.07.004_bib0001","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1007\/s10878-017-0205-2","article-title":"Safe sets in graphs: graph classes and structural parameters","volume":"36","author":"\u00c1gueda","year":"2018","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cor.2019.07.004_bib0002","series-title":"Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings","first-page":"241","article-title":"Safe sets in graphs: graph classes and structural parameters","author":"\u00c1gueda","year":"2016"},{"issue":"Complete","key":"10.1016\/j.cor.2019.07.004_bib0003","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.conengprac.2013.11.003","article-title":"Guaranteeing safety for heavy duty vehicle platooning: safe set computations and experimental evaluations","volume":"24","author":"Alam","year":"2014","journal-title":"Control Eng. Pract."},{"key":"10.1016\/j.cor.2019.07.004_bib0004","series-title":"Maximal Safe Set Computation for Idle Speed Control of an Automotive Engine","author":"Balluchi","year":"2000"},{"key":"10.1016\/j.cor.2019.07.004_bib0005","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.endm.2016.09.015","article-title":"Network majority on tree topological network","volume":"54","author":"Bapat","year":"2016","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.cor.2019.07.004_bib0006","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.dam.2016.07.020","article-title":"Safe set problem on graphs","volume":"215","author":"Fujita","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2019.07.004_bib0007","first-page":"243","article-title":"On safe sets of the Cartesian product of two complete graphs","volume":"141","author":"Kang","year":"2018","journal-title":"Ars Comb."},{"key":"10.1016\/j.cor.2019.07.004_sbref0008","series-title":"Proc. Int. Conf. on World Wide Web Companion","article-title":"KONECT - the Koblenz network collection","author":"Kunegis","year":"2013"},{"issue":"6","key":"10.1016\/j.cor.2019.07.004_bib0009","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.cor.2019.07.004_sbref0010","series-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","author":"Rossi","year":"2015"},{"issue":"2","key":"10.1016\/j.cor.2019.07.004_bib0011","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/TAC.2003.822860","article-title":"Computation of maximal safe sets for switching systems","volume":"49","author":"Santis","year":"2004","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.cor.2019.07.004_bib0012","unstructured":"Siek, J., Lee, L.-Q., Lumsdaine, A., 2000. Boost random number library. http:\/\/www.boost.org\/libs\/graph\/."},{"key":"10.1016\/j.cor.2019.07.004_bib0013","unstructured":"Trick, M., 2017. Colouring graphs. URL http:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054819301807?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054819301807?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T08:45:45Z","timestamp":1569228345000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054819301807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":13,"alternative-id":["S0305054819301807"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2019.07.004","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new formulation for the Safe Set problem on graphs","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2019.07.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}
