乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T16:52:15Z","timestamp":1726419135435},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T00:00:00Z","timestamp":1647043200000},"content-version":"vor","delay-in-days":1472,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100005283","name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["4543945\/2016"],"id":[{"id":"10.13039\/501100005283","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["306187\/2015-9","425297\/2016-0"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.dam.2017.11.007","type":"journal-article","created":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T09:50:26Z","timestamp":1513158626000},"page":"33-42","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["The convexity of induced paths of order three and applications: Complexity aspects"],"prefix":"10.1016","volume":"237","author":[{"given":"Rafael T.","family":"Ara\u00fajo","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5889-5183","authenticated-orcid":false,"given":"Rudini M.","family":"Sampaio","sequence":"additional","affiliation":[]},{"given":"Vin\u00edcius F.","family":"dos Santos","sequence":"additional","affiliation":[]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2017.11.007_b1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.12.035","article-title":"On the hull number of some graph classes","volume":"475","author":"Ara\u00fajo","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2017.11.007_b2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1137\/110828678","article-title":"On the Carath\u00e9odory number for the convexity of paths of order three","volume":"26","author":"Barbosa","year":"2012","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2017.11.007_b3","unstructured":"V. Campos, R. Sampaio, A. Silva, J.L. Szwarcfiter, Graphs with few P4\u2019s under the convexity of paths of order three, in: Proc. of CTW\u20192011, Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2011."},{"key":"10.1016\/j.dam.2017.11.007_b4","doi-asserted-by":"crossref","first-page":"3693","DOI":"10.1016\/j.tcs.2011.03.029","article-title":"Irreversible conversion of graphs","volume":"412","author":"Centeno","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2017.11.007_b5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.endm.2009.02.003","article-title":"On the convexity of paths of length two in undirected graphs","volume":"32","author":"Centeno","year":"2009","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.dam.2017.11.007_b6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0012-365X(98)00394-X","article-title":"On triangle path convexity in graphs","volume":"206","author":"Changat","year":"1999","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2017.11.007_b7","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","article-title":"The Complexity of multiterminal cuts","volume":"23","author":"Dahlhaus","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2017.11.007_b8","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.disc.2009.09.018","article-title":"Some remarks on the geodetic number of a graph","volume":"310","author":"Dourado","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2017.11.007_b9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s00373-011-1049-7","article-title":"On the convexity number of graphs","volume":"28","author":"Dourado","year":"2012","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2017.11.007_b10","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1016\/j.dam.2009.11.016","article-title":"Complexity results related to monophonic convexity","volume":"158","author":"Dourado","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.11.007_b11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.tcs.2013.09.004","article-title":"On the Carath\u00e9odory number of interval and graph convexities","volume":"510","author":"Dourado","year":"2013","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2017.11.007_b12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10479-013-1320-9","article-title":"Algorithmic and structural aspects of the P3-Radon number","volume":"206","author":"Dourado","year":"2013","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.dam.2017.11.007_b13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/S0895480195321718","article-title":"Convexity and HHD-free graphs","volume":"12","author":"Dragan","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2017.11.007_b14","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF02945032","article-title":"Some remarks on simple tournaments","volume":"2","author":"Erd\u0151s","year":"1972","journal-title":"Algebra Universalis"},{"key":"10.1016\/j.dam.2017.11.007_b15","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.dam.2017.11.007_b16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.11.007_b17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2017.11.007_b18","series-title":"WG-2014 Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"372","article-title":"The maximum time of 2-neighbour bootstrap percolation: complexity results","volume":"vol. 8747","author":"Marcilon","year":"2014"},{"key":"10.1016\/j.dam.2017.11.007_b19","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0012-365X(72)90016-7","article-title":"Embedding tournaments in simple tournaments","volume":"2","author":"Moon","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2017.11.007_b20","first-page":"570","article-title":"Convexity in tournaments","volume":"45","author":"Varlet","year":"1976","journal-title":"Bull. Soc. Roy. Sci. Li\u00e8ge"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17305280?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17305280?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T21:21:10Z","timestamp":1647033670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X17305280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":20,"alternative-id":["S0166218X17305280"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2017.11.007","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The convexity of induced paths of order three and applications: Complexity aspects","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2017.11.007","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"}]}}