{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T03:46:17Z","timestamp":1792554377520,"version":"4.5.0"},"reference-count":167,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T00:00:00Z","timestamp":1524096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an intermediate feasible solution. The solution space can be represented as a reconfiguration graph, where two vertices representing solutions are adjacent if one can be formed from the other in a single step. Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?) This survey discusses techniques, results, and future directions in the area.<\/jats:p>","DOI":"10.3390\/a11040052","type":"journal-article","created":{"date-parts":[[2018,4,20]],"date-time":"2018-04-20T04:24:21Z","timestamp":1524198261000},"page":"52","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":169,"title":["Introduction to Reconfiguration"],"prefix":"10.3390","volume":"11","author":[{"given":"Naomi","family":"Nishimura","sequence":"first","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, ON N2L 3G1, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1137\/16M1069171","article-title":"How to Morph Planar Graph Drawings","volume":"46","author":"Alamdari","year":"2017","journal-title":"SIAM J. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00454-003-0006-7","article-title":"Blowing Up Polygonal Linkages","volume":"30","author":"Connelly","year":"2003","journal-title":"Discret. Comput. Geom."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.2307\/2369492","article-title":"Notes on the \u201c15\u201d Puzzle","volume":"2","author":"Johnson","year":"1879","journal-title":"Am. J. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","article-title":"On the complexity of reconfiguration problems","volume":"412","author":"Ito","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","article-title":"A survey of very large-scale neighborhood search techniques","volume":"123","author":"Ahuja","year":"2002","journal-title":"Discret. Appl. Math."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.jcss.2011.10.003","article-title":"Local Search: Is Brute-force Avoidable?","volume":"78","author":"Fellows","year":"2012","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Gaspers, S., Kim, E.J., Ordyniak, S., Saurabh, S., and Szeider, S. (2012, January 22\u201326). Don\u2019t Be Strict in Local Search!. Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Toronto, ON, Canada.","DOI":"10.1609\/aaai.v26i1.8128"},{"key":"ref_8","unstructured":"Gutin, G., and Punnen, A.P. (2002). The Traveling Salesman Problem and Its Variations, Combinatorial Optimization, Kluwer Academic."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1002\/net.10091","article-title":"Reoptimizing the traveling salesman problem","volume":"42","author":"Archetti","year":"2003","journal-title":"Networks"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Shachnai, H., Tamir, G., and Tamir, T. (2012, January 16\u201320). A Theory and Algorithms for Combinatorial Reoptimization. Proceedings of the 10th Latin American Symposium on LATIN 2012: Theoretical Informatics, Arequipa, Peru.","DOI":"10.1007\/978-3-642-29344-3_52"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00224-016-9729-6","article-title":"Incremental Problems in the Parameterized Complexity Setting","volume":"60","author":"Mans","year":"2017","journal-title":"Theory Comput. Syst."},{"key":"ref_12","unstructured":"Garey, M.R., and Johnson, D.S. (1990). Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co."},{"key":"ref_13","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms, MIT Press. [3rd ed.]."},{"key":"ref_14","first-page":"127","article-title":"The complexity of change","volume":"Volume 409","year":"2013","journal-title":"Surveys in Combinatorics 2013"},{"key":"ref_15","unstructured":"Mouawad, A.E. (2015). On Reconfiguration Problems: Structure and Tractability. [Ph.D. Thesis, University of Waterloo]."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","article-title":"PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation","volume":"343","author":"Hearn","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","article-title":"Complexity of independent set reconfigurability problems","volume":"439","author":"Medvedev","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","article-title":"Shortest paths between shortest paths","volume":"412","author":"Medvedev","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"ref_19","unstructured":"De Berg, M., Jansen, B.M.P., and Mukherjee, D. (2016, January 13\u201315). Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, Chennai, India."},{"key":"ref_20","unstructured":"McDonald, D.C. (arXiv, 2015). Connectedness and Hamiltonicity of graphs on vertex colorings, arXiv."},{"key":"ref_21","unstructured":"Fernau, H., Haas, R., Nishimura, N., and Seyffarth, K. (Private Discussion, 2017). Private Discussion."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Hanaka, T., Ito, T., Mizuta, H., Moore, B., Nishimura, N., Subramanya, V., Suzuki, A., and Vaidyanathan, K. (arXiv, 2018). Reconfiguring spanning and induced subgraphs, arXiv.","DOI":"10.1007\/978-3-319-94776-1_36"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"M\u00fchlenthaler, M. (2015, January 24\u201328). Degree-contrained Subgraph Reconfiguration is in P. Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, Milan, Italy.","DOI":"10.1007\/978-3-662-48054-0_42"},{"key":"ref_24","unstructured":"Hatanaka, T. Private Communication."},{"key":"ref_25","unstructured":"Felsner, S., Huemer, C., and Saumell, M. (July, January 29). Recoloring Directed Graphs. Proceedings of the XIII Encuentros de Geometr\u00eda Computacional, Zaragoza, Spain."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2017.11.013","article-title":"Fixing improper colorings of graphs","volume":"711","author":"Garnero","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Ito, T., Ono, H., and Otachi, Y. (2015, January 18\u201320). Reconfiguration of Cliques in a Graph. Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation, Singapore.","DOI":"10.1007\/978-3-319-17142-5_19"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1587\/transinf.2015FCP0010","article-title":"Reconfiguration of Vertex Covers in a Graph","volume":"99-D","author":"Ito","year":"2016","journal-title":"IEICE Trans."},{"key":"ref_29","unstructured":"Ausiello, G. (1999). Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/s10878-012-9562-z","article-title":"Approximability of the subset sum reconfiguration problem","volume":"28","author":"Ito","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_31","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":"Discret. Math."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/jgt.20514","article-title":"Finding paths between 3-colorings","volume":"67","author":"Cereceda","year":"2011","journal-title":"J. Graph Theory"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Johnson, M., Kratsch, D., Kratsch, S., Patel, V., and Paulusma, D. (2014, January 10\u201312). Finding Shortest Paths Between Graph Colourings. Proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, Wroclaw, Poland.","DOI":"10.1007\/978-3-319-13524-3_19"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1137\/07070440X","article-title":"The connectivity of Boolean satisfiability: Computational and structural dichotomies","volume":"38","author":"Gopalan","year":"2009","journal-title":"SIAM J. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","article-title":"Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances","volume":"410","author":"Bonsma","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1016\/j.dam.2012.05.014","article-title":"Reconfiguration of list edge-colorings in a graph","volume":"160","author":"Ito","year":"2012","journal-title":"Discret. Appl. Math."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2014.04.011","article-title":"Reconfiguration of list L(2,1)-labelings in a graph","volume":"544","author":"Ito","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_38","unstructured":"Mizuta, H., Ito, T., and Zhou, X. (2016, January 17\u201319). Reconfiguration of Steiner Trees in an Unweighted Graph. Proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Helsinki, Finland."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Bonsma, P.S. (2012, January 27\u201331). The complexity of rerouting shortest paths. Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia.","DOI":"10.1007\/978-3-642-32589-2_22"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Osawa, H., Suzuki, A., Ito, T., and Zhou, X. (2017, January 16\u201320). The complexity of (list) edge-coloring reconfiguration problem. Proceedings of the 11th International Conference and Workshops on Algorithms and Computation, Limerick, Ireland.","DOI":"10.1007\/978-3-319-53925-6_27"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Diestel, R. (2005). Graph Theory, Springer. Electronic Edition.","DOI":"10.4171\/owr\/2005\/03"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1002\/jgt.21992","article-title":"Independent Set Reconfiguration in Cographs and their Generalizations","volume":"83","author":"Bonsma","year":"2016","journal-title":"J. Graph Theory"},{"key":"ref_43","unstructured":"Bonsma, P.S. (2012, January 15\u201317). Rerouting shortest paths in planar graphs. Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, Hyderabad, India."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1587\/transfun.E98.A.1168","article-title":"The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs","volume":"98-A","author":"Hatanaka","year":"2015","journal-title":"IEICE Trans."},{"key":"ref_45","unstructured":"Bonsma, P.S., and Paulusma, D. (2016, January 22\u201326). Using Contracted Solution Graphs for Solving Reconfiguration Problems. Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, Krak\u00f3w, Poland."},{"key":"ref_46","unstructured":"Schiex, T. (1999). A Note on CSP Graph Parameters, French National Institute for Agricultural Research (INRA). Technical Report 1999\/03."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2017.11.003","article-title":"Reconfiguration in bounded bandwidth and tree-depth","volume":"93","author":"Wrochna","year":"2018","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267170","article-title":"Recursive unsolvability of a problem of Thue","volume":"12","author":"Post","year":"1947","journal-title":"J. Symb. Log."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., and Wrochna, M. (2014, January 10\u201312). Reconfiguration over Tree Decompositions. Proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, Wroclaw, Poland.","DOI":"10.1007\/978-3-319-13524-3_21"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.tcs.2016.08.016","article-title":"The complexity of dominating set reconfiguration","volume":"651","author":"Haddadan","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"ref_51","unstructured":"Van der Zanden, T.C. (2015, January 16\u201318). Parameterized Complexity of Graph Constraint Logic. Proceedings of the 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, Patras, Greece."},{"key":"ref_52","unstructured":"Lokshtanov, D., and Mouawad, A.E. (2008, January 20\u201322). The complexity of independent set reconfiguration on biparite graphs. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA."},{"key":"ref_53","unstructured":"Tebbal, Y. (2015). On the Complexity of Reconfiguration of Clique, Cluster Vertex Deletion, and Dominating Set. [Master\u2019s Thesis, University of Waterloo]."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., and Raman, V. (2014, January 15\u201317). Vertex Cover Reconfiguration and Beyond. Proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, Jeonju, Korea.","DOI":"10.1007\/978-3-319-13075-0_36"},{"key":"ref_55","unstructured":"Bonamy, M., and Bousquet, N. (CoRR, 2014). Reconfiguring Independent Sets in Cographs, CoRR."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Bonamy, M., and Bousquet, N. (2017, January 21\u201323). Token Sliding on Chordal Graphs. Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Eindhoven, The Netherlands.","DOI":"10.1007\/978-3-319-68705-6_10"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Bonsma, P.S., Kaminski, M., and Wrochna, M. (2014, January 2\u20134). Reconfiguring Independent Sets in Claw-Free Graphs. Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory\u2014SWAT 2014, Copenhagen, Denmark.","DOI":"10.1007\/978-3-319-08404-6_8"},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Yamada, T., and Uehara, R. (2016, January 29\u201331). Shortest Reconfiguration of Sliding Tokens on a Caterpillar. Proceedings of the 10th International Workshop on WALCOM: Algorithms and Computation, WALCOM 2016, Kathmandu, Nepal.","DOI":"10.1007\/978-3-319-30139-6_19"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.tcs.2015.07.037","article-title":"Linear-time algorithm for sliding tokens on trees","volume":"600","author":"Demaine","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Fox-Epstein, E., Hoang, D.A., Otachi, Y., and Uehara, R. (2015, January 9\u201311). Sliding Token on Bipartite Permutation Graphs. Proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, Nagoya, Japan.","DOI":"10.1007\/978-3-662-48971-0_21"},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Hoang, D.A., and Uehara, R. (CoRR, 2017). Polynomial-Time Algorithms for Sliding Tokens on Cactus Graphs and Block Graphs, CoRR.","DOI":"10.1007\/978-3-319-53925-6_36"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Hoang, D.A., Fox-Epstein, E., and Uehara, R. (2017, January 29\u201331). Sliding Tokens on Block Graphs. Proceedings of the 11th International Conference and Workshops on WALCOM: Algorithms and Computation, WALCOM 2017, Hsinchu, Taiwan.","DOI":"10.1007\/978-3-319-53925-6_36"},{"key":"ref_63","unstructured":"Hoang, D.A., and Uehara, R. (2016, January 12\u201314). Sliding Tokens on a Cactus. Proceedings of the 27th International Symposium on Algorithms and Computation, ISAAC 2016, Sydney, Australia."},{"key":"ref_64","unstructured":"M\u00fchlenthaler, M. (2017). st-Connectivity of Common Independent Sets of Partition Matroids, unpublished."},{"key":"ref_65","unstructured":"Downey, R.G., and Fellows, M.R. (1997). Parameterized Complexity, Springer."},{"key":"ref_66","unstructured":"Fernau, H., Hagerup, T., Nishimura, N., Ragde, P., and Reinhardt, K. (2003, January 11\u201313). On the parameterized complexity of the generalized Rush Hour puzzle. Proceedings of the 15th Canadian Conference on Computational Geometry, Halifax, Nova Scotia."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Niedermeier, R. (2006). Invitation to Fixed-Parameter Algorithms, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., and Suzuki, A. (2013, January 4\u20136). On the parameterized complexity of reconfiguration problems. Proceedings of the 8th International Symposium on Parameterized and Exact Computation, Sophia Antipolis, France.","DOI":"10.1007\/978-3-319-03898-8_24"},{"key":"ref_69","unstructured":"Wasa, K., Yamanaka, K., and Arimura, H. (2016, January 14\u201318). The Complexity of Induced Tree Reconfiguration Problems. Proceedings of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016, Prague, Czech Republic."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/s00453-016-0159-2","article-title":"On the Parameterized Complexity of Reconfiguration Problems","volume":"78","author":"Mouawad","year":"2017","journal-title":"Algorithmica"},{"key":"ref_71","unstructured":"Ito, T., Kaminski, M., Ono, H., Suzuki, A., Uehara, R., and Yamanaka, K. (2014, January 11\u201313). On the Parameterized Complexity for Token Jumping on Graphs. Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, Chennai, India."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Ito, T., Kaminski, M.J., and Ono, H. (2014, January 15\u201317). Fixed-Parameter Tractability of Token Jumping on Planar Graphs. Proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, Jeonju, Korea.","DOI":"10.1007\/978-3-319-13075-0_17"},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Mary, A., and Parreau, A. (2017, January 11\u201313). Token Jumping in Minor-Closed Classes. Proceedings of the 21st International Symposium on Fundamentals in Computation Theory (FCT 2017), Bordeaux, France.","DOI":"10.1007\/978-3-662-55751-8_12"},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Mouawad, A.E., Panolan, F., Ramanujan, M.S., and Saurabh, S. (2015, January 5\u20137). Reconfiguration on Sparse Graphs. Proceedings of the 14th International Symposium on Algorithms and Data Structures, WADS 2015, Victoria, BC, Canada.","DOI":"10.1007\/978-3-319-21840-3_42"},{"key":"ref_75","unstructured":"Hatanaka, T., Ito, T., and Zhou, X. (2017, January 27\u201331). Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Liverpool, UK."},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"Siebertz, S. (CoRR, 2017). Reconfiguration on nowhere dense graphs, CoRR.","DOI":"10.37236\/7458"},{"key":"ref_77","unstructured":"Cereceda, L. (2007). Mixing Graph Colourings. [Ph.D. Thesis, London School of Economics and Political Science]."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.ejc.2009.03.011","article-title":"Mixing 3-colourings in bipartite graphs","volume":"30","author":"Cereceda","year":"2009","journal-title":"Eur. J. Comb."},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Bonsma, P.S., Mouawad, A.E., Nishimura, N., and Raman, V. (2014, January 10\u201312). The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. Proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, Wroclaw, Poland.","DOI":"10.1007\/978-3-319-13524-3_10"},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On colouring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1002\/jgt.22000","article-title":"A Reconfigurations Analogue of Brooks\u2019 Theorem and Its Consequences","volume":"83","author":"Feghali","year":"2016","journal-title":"J. Graph Theory"},{"key":"ref_82","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":"ref_83","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":"ref_84","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/s10878-012-9490-y","article-title":"Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs","volume":"27","author":"Bonamy","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.endm.2013.10.040","article-title":"Recoloring bounded treewidth graphs","volume":"44","author":"Bonamy","year":"2013","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_86","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejc.2015.08.001","article-title":"Fast recoloring of sparse graphs","volume":"52","author":"Bousquet","year":"2016","journal-title":"Eur. J. Comb."},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s00453-015-0009-7","article-title":"Finding Shortest Paths Between Graph Colourings","volume":"75","author":"Johnson","year":"2016","journal-title":"Algorithmica"},{"key":"ref_88","unstructured":"Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., and Paulusma, D. (CoRR, 2017). Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration, CoRR."},{"key":"ref_89","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2369235","article-title":"On the geographical problem of the four colours","volume":"2","author":"Kempe","year":"1879","journal-title":"Am. J. Math."},{"key":"ref_90","unstructured":"M\u00fchlenthaler, M., and Wanka, R. (CoRR, 2015). On the Connectedness of Clash-free Timetables, CoRR."},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/S0001-8708(77)80048-0","article-title":"Geometric coloring theory","volume":"24","author":"Fisk","year":"1977","journal-title":"Adv. Math."},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(78)90042-4","article-title":"Les 5-colorations d\u2019un graphe planaire forment une classe de commutation unique","volume":"24","author":"Meyniel","year":"1978","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_93","doi-asserted-by":"crossref","unstructured":"Mohar, B. (2007). Kempe equivalence of colorings. Graph Theory in Paris, Birkhauser. Trends in Mathematics.","DOI":"10.1007\/978-3-7643-7400-6_22"},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0095-8956(81)80014-7","article-title":"Kempe classes and the Hadwiger Conjecture","volume":"31","author":"Vergnas","year":"1981","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_95","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0095-8956(90)90077-D","article-title":"Perfectly contractile graphs","volume":"50","author":"Bertschi","year":"1990","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_96","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/jgt.20613","article-title":"Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs","volume":"70","author":"McDonald","year":"2012","journal-title":"J. Graph Theory"},{"key":"ref_97","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disc.2014.02.014","article-title":"Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs","volume":"325","author":"Belcastro","year":"2014","journal-title":"Discret. Math."},{"key":"ref_98","unstructured":"Bonamy, M., Bousquet, N., Feghali, C., and Johnson, M. (CoRR, 2015). On a conjecture of Mohar concerning Kempe equivalence of regular graphs, CoRR."},{"key":"ref_99","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejc.2016.06.008","article-title":"Kempe equivalence of colourings of cubic graphs","volume":"59","author":"Feghali","year":"2017","journal-title":"Eur. J. Comb."},{"key":"ref_100","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1587\/transinf.E95.D.737","article-title":"An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree","volume":"95-D","author":"Ito","year":"2012","journal-title":"IEICE Trans."},{"key":"ref_101","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/jgt.21846","article-title":"Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings","volume":"80","author":"Brewster","year":"2015","journal-title":"J. Graph Theory"},{"key":"ref_102","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.05.015","article-title":"A dichotomy theorem for circular colouring reconfiguration","volume":"639","author":"Brewster","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"ref_103","unstructured":"Vaidyanathan, K. (2017). Refiguring Graph Colorings. [Master\u2019s Thesis, University of Waterloo]."},{"key":"ref_104","unstructured":"Wrochna, M. (2015, January 4\u20137). Homomorphism Reconfiguration via Homotopy. Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, Garching, Germany."},{"key":"ref_105","unstructured":"Brewster, R.C., Lee, J.B., Moore, B., Noel, J.A., and Siggers, M. (arXiv, 2017). Graph Homomorphism Reconfiguration and Frozen H-Colourings, arXiv."},{"key":"ref_106","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":"2012","journal-title":"Ars Math. Contemp."},{"key":"ref_107","doi-asserted-by":"crossref","unstructured":"Asplund, J., Edoh, K., Haas, R., Hristova, Y., Novick, B., and Werner, B. (CoRR, 2017). Reconfiguration graphs of shortest paths, CoRR.","DOI":"10.1016\/j.disc.2018.07.007"},{"key":"ref_108","first-page":"45","article-title":"The k-independent graph of a graph","volume":"18","author":"Fatehi","year":"2017","journal-title":"Adv. Appl. Discret. Math."},{"key":"ref_109","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00373-011-1055-9","article-title":"Token Graphs","volume":"28","author":"Monroy","year":"2012","journal-title":"Graphs Comb."},{"key":"ref_110","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":"ref_111","doi-asserted-by":"crossref","first-page":"647","DOI":"10.5666\/KMJ.2016.56.3.647","article-title":"Reconfiguring k-colourings of complete bipartite graphs","volume":"56","author":"Celaya","year":"2016","journal-title":"Kyungpook Math. J."},{"key":"ref_112","unstructured":"Bard, S. (2012). Gray Code Numbers of Complete Multipartite Graphs. [Master\u2019s Thesis, University of Victoria]."},{"key":"ref_113","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":"Discret. Math."},{"key":"ref_114","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s00373-013-1302-3","article-title":"The k-Dominating Graph","volume":"30","author":"Haas","year":"2014","journal-title":"Graphs Comb."},{"key":"ref_115","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s00373-017-1792-5","article-title":"On the Structure of Dominating Graphs","volume":"33","author":"Alikhani","year":"2017","journal-title":"Graphs Comb."},{"key":"ref_116","first-page":"17","article-title":"\u03b3-graph of a graph","volume":"5","author":"Subramanian","year":"2008","journal-title":"Bull. Kerala Math. Assoc."},{"key":"ref_117","doi-asserted-by":"crossref","first-page":"517","DOI":"10.7151\/dmgt.1562","article-title":"\u03b3-graphs of graphs","volume":"31","author":"Fricke","year":"2011","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_118","unstructured":"Mynhardt, C.M., and Teshima, L.E. (CoRR, 2017). A note on some variations of the \u03b3-graph, CoRR."},{"key":"ref_119","unstructured":"Edwards, M. (2015). Vertex-Criticality and Bicriticality for Independent Domination and Total Domination in Graphs. [Ph.D. Thesis, University of Victoria]."},{"key":"ref_120","first-page":"53","article-title":"The gamma graph of a graph","volume":"7","author":"Lakshmanan","year":"2010","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_121","first-page":"231","article-title":"Trees and unicyclic graphs are \u03b3-graphs","volume":"69","author":"Sridharan","year":"2009","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"ref_122","doi-asserted-by":"crossref","unstructured":"Sridharan, N., Amutha, S., and Rao, S.B. (2013). Induced subgraphs of gamma graphs. Discret. Math. Algorithms Appl., 5.","DOI":"10.1142\/S1793830913500122"},{"key":"ref_123","unstructured":"Dyck, A., Jedwab, J., DeVos, M., and Simon, S. (2017). The realisability of \u03b3-graphs, unpublished."},{"key":"ref_124","unstructured":"Dyck, A. (2017). The Realisability of \u03b3-Graphs. [Master\u2019s Thesis, Simon Fraser University]."},{"key":"ref_125","first-page":"25","article-title":"Gamma graphs of some special classes of trees","volume":"29","year":"2015","journal-title":"Ann. Math. Sil."},{"key":"ref_126","first-page":"23","article-title":"A note on \u03b3-Graphs","volume":"8","author":"Connelly","year":"2010","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_127","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1007\/s10878-015-9947-x","article-title":"Reconfiguration of dominating sets","volume":"32","author":"Suzuki","year":"2016","journal-title":"J. Comb. Optim."},{"key":"ref_128","doi-asserted-by":"crossref","first-page":"1802","DOI":"10.1016\/j.disc.2017.03.007","article-title":"Reconfiguring dominating sets in some well-covered and other classes of graphs","volume":"340","author":"Haas","year":"2017","journal-title":"Discret. Math."},{"key":"ref_129","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J. (1978, January 1\u20133). The Complexity of Satisfiability Problems. Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA.","DOI":"10.1145\/800133.804350"},{"key":"ref_130","first-page":"173","article-title":"A Computational Trichotomy for Connectivity of Boolean Satisfiability","volume":"8","author":"Schwerdtfeger","year":"2014","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"ref_131","doi-asserted-by":"crossref","first-page":"2024","DOI":"10.1016\/j.dam.2010.08.019","article-title":"On the Boolean connectivity problem for Horn relations","volume":"158","author":"Makino","year":"2010","journal-title":"Discret. Appl. Math."},{"key":"ref_132","doi-asserted-by":"crossref","first-page":"4613","DOI":"10.1016\/j.tcs.2011.04.041","article-title":"An exact algorithm for the Boolean connectivity problem for k-CNF","volume":"412","author":"Makino","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"ref_133","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Pathak, V., and Raman, V. (2015, January 6\u201310). Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, Kyoto, Japan. Part I.","DOI":"10.1007\/978-3-662-47672-7_80"},{"key":"ref_134","unstructured":"Gharibian, S., and Sikora, J. (2015, January 6\u201310). Ground State Connectivity of Local Hamiltonians. Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, Kyoto, Japan. Part I."},{"key":"ref_135","doi-asserted-by":"crossref","unstructured":"Lawson, C. (1977). Software for c1 surface interpolation. Mathematical Software III, Academic Press.","DOI":"10.1016\/B978-0-12-587260-7.50011-X"},{"key":"ref_136","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.comgeo.2014.11.001","article-title":"Flip distance between two triangulations of a point set is NP-complete","volume":"49","author":"Lubiw","year":"2015","journal-title":"Comput. Geom."},{"key":"ref_137","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.comgeo.2014.01.001","article-title":"Flip distance between triangulations of a planar point set is APX-hard","volume":"47","author":"Pilz","year":"2014","journal-title":"Comput. Geom."},{"key":"ref_138","unstructured":"Kanj, I.A., and Xia, G. (2015, January 4\u20137). Flip Distance is in FPT time O(n + k \u00b7 ck). Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, Garching, Germany."},{"key":"ref_139","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.tcs.2015.01.052","article-title":"Swapping labeled tokens on graphs","volume":"586","author":"Yamanaka","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"ref_140","unstructured":"Papadimitriou, C.H., Raghavan, P., Sudan, M., and Tamaki, H. (1994, January 20\u201322). Motion Planning on a Graph (Extended Abstract). Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_141","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.dam.2010.02.001","article-title":"Feasibility of motion planning on acyclic and strongly connected directed graphs","volume":"158","author":"Wu","year":"2010","journal-title":"Discret. Appl. Math."},{"key":"ref_142","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/060652063","article-title":"Reconfigurations in Graphs and Grids","volume":"22","author":"Dumitrescu","year":"2008","journal-title":"SIAM J. Discret. Math."},{"key":"ref_143","doi-asserted-by":"crossref","unstructured":"Yamanaka, K., Demaine, E.D., Horiyama, T., Kawamura, A., Nakano, S., Okamoto, Y., Saitoh, T., Suzuki, A., Uehara, R., and Uno, T. (2017, January 29\u201331). Sequentially Swapping Colored Tokens on Graphs. Proceedings of the 11th International Conference and Workshops on WALCOM: Algorithms and Computation (WALCOM 2017), Hsinchu, Taiwan.","DOI":"10.1007\/978-3-319-53925-6_34"},{"key":"ref_144","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00373-005-0640-1","article-title":"Pushing Squares Around","volume":"22","author":"Dumitrescu","year":"2006","journal-title":"Graphs Comb."},{"key":"ref_145","doi-asserted-by":"crossref","unstructured":"Lubiw, A., Mas\u00e1rov\u00e1, Z., and Wagner, U. (2017, January 4\u20137). Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. Proceedings of the 33rd International Symposium on Computational Geometry, Brisbane, Australia.","DOI":"10.1007\/s00454-018-0035-8"},{"key":"ref_146","unstructured":"Moore, B., Nishimura, N., and Subramanya, V. (2018). Reconfiguring minors, unpublished."},{"key":"ref_147","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0095-8956(74)90098-7","article-title":"Graph puzzles, homotopy, and the alternating group","volume":"16","author":"Wilson","year":"1974","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_148","doi-asserted-by":"crossref","first-page":"459","DOI":"10.3390\/a8030459","article-title":"Solving the (n2 - 1)-Puzzle with 8\/3 n3 Expected Moves","volume":"8","author":"Parberry","year":"2015","journal-title":"Algorithms"},{"key":"ref_149","unstructured":"Ratner, D., and Warmuth, M.K. (1986, January 11\u201315). Finding a Shortest Solution for the N \u00d7 N Extension of the 15-PUZZLE Is Intractable. Proceedings of the 5th National Conference on Artificial Intelligence, Philadelphia, PA, USA."},{"key":"ref_150","doi-asserted-by":"crossref","unstructured":"Goldreich, O. (2011). Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard. Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation\u2014In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, Springer.","DOI":"10.1007\/978-3-642-22670-0_1"},{"key":"ref_151","doi-asserted-by":"crossref","unstructured":"Kornhauser, D., Miller, G.L., and Spirakis, P.G. (1984, January 24\u201326). Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications. Proceedings of the 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, FL, USA.","DOI":"10.1109\/SFCS.1984.715921"},{"key":"ref_152","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/PL00009259","article-title":"A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees","volume":"23","author":"Auletta","year":"1999","journal-title":"Algorithmica"},{"key":"ref_153","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s00453-009-9290-7","article-title":"Multi-Color Pebble Motion on Graphs","volume":"58","author":"Goraly","year":"2010","journal-title":"Algorithmica"},{"key":"ref_154","unstructured":"Trakultraipruk, S. (2013). Connectivity Properties of Some Transformation Graphs. [Ph.D. Thesis, London School of Economics and Political Science]."},{"key":"ref_155","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A Group-Theoretic Model for Symmetric Interconnection Networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"ref_156","unstructured":"Miltzow, T., Narins, L., Okamoto, Y., Rote, G., Thomas, A., and Uno, T. (2016, January 22\u201324). Approximation and Hardness of Token Swapping. Proceedings of the 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark."},{"key":"ref_157","unstructured":"Bonnet, \u00c9., Miltzow, T., and Rz\u0105\u017cewski, P. (2017, January 8\u201311). Complexity of Token Swapping and its Variants. Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany."},{"key":"ref_158","first-page":"527","article-title":"LXXVII. Note on the theory of permutations","volume":"34","author":"Cayley","year":"1849","journal-title":"Philos. Mag."},{"key":"ref_159","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0012-365X(98)00377-X","article-title":"Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees","volume":"204","author":"Pak","year":"1999","journal-title":"Discret. Math."},{"key":"ref_160","first-page":"1","article-title":"Swapping Labeled Tokens on Complete Split Graphs","volume":"2015-AL-153","author":"Yasui","year":"2015","journal-title":"Inf. Process. Soc. Jpn. SIG Tech. Rep."},{"key":"ref_161","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1089\/106652703322539097","article-title":"Sorting by Short Swaps","volume":"10","author":"Heath","year":"2003","journal-title":"J. Comput. Biol."},{"key":"ref_162","doi-asserted-by":"crossref","unstructured":"Yamanaka, K., Horiyama, T., Kirkpatrick, D.G., Otachi, Y., Saitoh, T., Uehara, R., and Uno, Y. (2015, January 5\u20137). Swapping Colored Tokens on Graphs. Proceedings of the 14th International Symposium on Algorithms and Data Structures, WADS 2015, Victoria, BC, Canada.","DOI":"10.1007\/978-3-319-21840-3_51"},{"key":"ref_163","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1016\/j.ejc.2011.09.019","article-title":"Colored pebble motion on graphs","volume":"33","author":"Fujita","year":"2012","journal-title":"Eur. J. Comb."},{"key":"ref_164","doi-asserted-by":"crossref","unstructured":"Kawahara, J., Saitoh, T., and Yoshinaka, R. (2017, January 29\u201331). The Time Complexity of the Token Swapping Problem and Its Parallel Variants. Proceedings of the 11th International Conference and Workshops on WALCOM: Algorithms and Computation (WALCOM 2017), Hsinchu, Taiwan.","DOI":"10.1007\/978-3-319-53925-6_35"},{"key":"ref_165","doi-asserted-by":"crossref","unstructured":"Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., and Okamoto, Y. (2017, January 3\u20135). Reconfiguration of Maximum-Weight b-Matchings in a Graph. Proceedings of the 23rd International Conference on Computing and Combinatorics, COCOON 2017, Hong Kong, China.","DOI":"10.1007\/978-3-319-62389-4_24"},{"key":"ref_166","unstructured":"Lubiw, A., and Pathak, V. (CoRR, 2016). Reconfiguring Ordered Bases of a Matroid, CoRR."},{"key":"ref_167","doi-asserted-by":"crossref","unstructured":"Nishimura, N., and Subramanya, V. (2017, January 16\u201318). Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. Proceedings of the 11th Annual International Conference on International Conference on Combinatorial Optimization and Applications (COCOA 2017), Shanghai, China.","DOI":"10.1007\/978-3-319-71147-8_10"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/4\/52\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:01:19Z","timestamp":1760194879000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/4\/52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,19]]},"references-count":167,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["a11040052"],"URL":"https:\/\/doi.org\/10.3390\/a11040052","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201709.0055.v1","asserted-by":"object"}]},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,19]]}}}