乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:20:23Z","timestamp":1720052423568},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1016\/j.dam.2023.01.027","type":"journal-article","created":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T12:22:37Z","timestamp":1675340557000},"page":"126-139","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Reconfiguration graphs of zero forcing sets"],"prefix":"10.1016","volume":"329","author":[{"given":"Jesse","family":"Geneson","sequence":"first","affiliation":[]},{"given":"Ruth","family":"Haas","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1673-3789","authenticated-orcid":false,"given":"Leslie","family":"Hogben","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2023.01.027_b1","series-title":"Hardness Results and Approximation Algorithms for Some Problems on Graphs","author":"Aazami","year":"2008"},{"key":"10.1016\/j.dam.2023.01.027_b2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10878-008-9176-7","article-title":"Domination in graphs with bounded propagation: Algorithms, formulations and hardness results","volume":"19","author":"Aazami","year":"2010","journal-title":"J. Combin. Optim."},{"key":"10.1016\/j.dam.2023.01.027_b3","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"AIM Minimum Rank \u2013 Special Graphs Work Group","year":"2008","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2023.01.027_b4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","article-title":"Zero forcing parameters and minimum rank problems","volume":"433","author":"Barioli","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2023.01.027_b5","doi-asserted-by":"crossref","first-page":"2100","DOI":"10.1016\/j.disc.2016.03.003","article-title":"Classifying coloring graphs","volume":"339","author":"Beier","year":"2016","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2023.01.027_b6","first-page":"221","article-title":"Zero forcing and power domination for graph products","volume":"70","author":"Benson","year":"2018","journal-title":"Australas. J. Combin."},{"key":"10.1016\/j.dam.2023.01.027_b7","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/j.ejor.2018.09.030","article-title":"Computational approaches for zero forcing and related problems","volume":"273","author":"Brimkov","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.dam.2023.01.027_b8","first-page":"1384","article-title":"Improved computational approaches and heuristics for zero forcing","volume":"33","author":"Brimkov","year":"2021","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.dam.2023.01.027_b9","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.99.100501","article-title":"Full control by locally induced relaxation","volume":"99","author":"Burgarth","year":"2007","journal-title":"Phys. Rev. Lett. PRL"},{"key":"10.1016\/j.dam.2023.01.027_b10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.13001\/1081-3810.2900","article-title":"Using variants of zero forcing to bound the inertia set of a graph","volume":"30","author":"Butler","year":"2015","journal-title":"Electron. J. Linear Algebra"},{"issue":"5","key":"10.1016\/j.dam.2023.01.027_b11","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.disc.2007.07.028","article-title":"Connectedness of the graph of vertex-colourings","volume":"308","author":"Cereceda","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2023.01.027_b12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.26493\/1855-3974.196.0df","article-title":"Gray code numbers for graphs","volume":"4","author":"Choo","year":"2011","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.dam.2023.01.027_b13","doi-asserted-by":"crossref","unstructured":"N. Dean, A. Ilic, I. Ramirez, J. Shen, K. Tian, On the power dominating sets of hypercubes, in: IEEE 14th International Conference on Computational Science and Engineering, CSE, 2011, pp. 488\u2013491.","DOI":"10.1109\/CSE.2011.89"},{"key":"10.1016\/j.dam.2023.01.027_b14","series-title":"Graph Theory","author":"Diestel","year":"2017"},{"key":"10.1016\/j.dam.2023.01.027_b15","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1002\/rsa.20129","article-title":"Randomly coloring sparse random graphs with fewer colors than the maximum degree","volume":"29","author":"Dyer","year":"2006","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.dam.2023.01.027_b16","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.laa.2007.05.036","article-title":"The minimum rank of symmetric matrices described by a graph: A survey","volume":"426","author":"Fallat","year":"2007","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2023.01.027_b17","series-title":"Handbook of Linear Algebra","article-title":"Minimum rank, maximum nullity, and zero forcing number of graphs","author":"Fallat","year":"2014"},{"key":"10.1016\/j.dam.2023.01.027_b18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.26493\/1855-3974.168.464","article-title":"The canonical coloring graph of trees and cycles","volume":"5","author":"Haas","year":"2011","journal-title":"Ars Math. Contemp."},{"key":"10.1016\/j.dam.2023.01.027_b19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/rsa.3240070205","article-title":"A very simple algorithm for estimating the number of k-colorings of a low-degree graph","volume":"7","author":"Jerrum","year":"1995","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/j.dam.2023.01.027_b20","series-title":"Graph Theory in Paris","first-page":"287","article-title":"Kempe equivalence of colorings","author":"Mohar","year":"2007"},{"key":"10.1016\/j.dam.2023.01.027_b21","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/S0097539702401786","article-title":"The Glauber dynamics on colorings of a graph with high girth and maximum degree","volume":"33","author":"Molloy","year":"2004","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2023.01.027_b22","series-title":"50 Years of Combinatorics, Graph Theory, and Computing","first-page":"171","article-title":"Reconfiguration of colourings and dominating sets in graphs","author":"Mynhardt","year":"2020"},{"key":"10.1016\/j.dam.2023.01.027_b23","first-page":"25","article-title":"Introduction to reconfiguration","volume":"11","author":"Nishimura","year":"2018","journal-title":"Algorithms (Basel)"},{"key":"10.1016\/j.dam.2023.01.027_b24","first-page":"1065","article-title":"On the zero forcing number of trees","volume":"45","author":"Oboudi","year":"2021","journal-title":"Trans. A: Sci."},{"key":"10.1016\/j.dam.2023.01.027_b25","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1063\/1.533196","article-title":"Improved bounds for sampling colorings, probabilistic techniques in equilibrium and nonequilibrium statistical physics","volume":"41","author":"Vigoda","year":"2000","journal-title":"J. Math. Phys."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X23000379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T03:05:52Z","timestamp":1711595152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X23000379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":25,"alternative-id":["S0166218X23000379"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2023.01.027","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reconfiguration graphs of zero forcing sets","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2023.01.027","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}