Introduction to Reconfiguration
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 t...
Saved in:
| Published in | Algorithms Vol. 11; no. 4; p. 52 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Basel
MDPI AG
19.04.2018
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Nishimura, Naomi |
| Author_xml | – sequence: 1 givenname: Naomi surname: Nishimura fullname: Nishimura, Naomi |
| BookMark | eNptkE1LAzEQhoMo2FYP_gILnjysnUmyHzlK8aNQEETPYTabLSl1U7PZg__etJUi4mnCy5NnhnfMTjvfWcauEO6EUDAjRJAAOT9hI1RKZbJS4vTX-5yN-34NUOSqwBG7XnQx-GYw0fluGv301RrftW41BNpFF-yspU1vL3_mhL0_PrzNn7Ply9Nifr_MjMhlzEyNtVR1IcuqFbLAsmg5EEcuigarmtDyRlYAjTWU14KUlbYlK7iqUowoJmxx8Dae1nob3AeFL-3J6X3gw0pTiM5srOZIpaEk5aaW1ojKEuWYqxIkB2llct0cXNvgPwfbR732Q-jS-ToBCIWQJSTq9kCZ4Ps-2Pa4FUHvutTHLhM7-8MaF_f9xEBu88-Pb62mdNM |
| CitedBy_id | crossref_primary_10_1007_s00373_022_02579_8 crossref_primary_10_1007_s00453_023_01117_z crossref_primary_10_1002_jgt_23064 crossref_primary_10_1016_j_tcs_2022_11_036 crossref_primary_10_1016_j_tcs_2023_114188 crossref_primary_10_1007_s00236_019_00336_8 crossref_primary_10_1103_PhysRevA_108_023107 crossref_primary_10_1016_j_tcs_2019_05_028 crossref_primary_10_1007_s10878_020_00630_z crossref_primary_10_1007_s00373_023_02644_w crossref_primary_10_1016_j_tcs_2018_11_024 crossref_primary_10_1587_transinf_2018FCP0005 crossref_primary_10_1007_s00373_020_02199_0 crossref_primary_10_1007_s00453_025_01294_z crossref_primary_10_1103_PhysRevA_108_023108 crossref_primary_10_1007_s00453_020_00700_y crossref_primary_10_5802_igt_8 crossref_primary_10_3390_a11110187 crossref_primary_10_1080_23799927_2023_2185543 crossref_primary_10_1007_s10878_024_01207_w crossref_primary_10_1016_j_tcs_2019_09_018 crossref_primary_10_1016_j_dam_2024_10_026 crossref_primary_10_1016_j_jctb_2022_01_006 crossref_primary_10_1007_s00453_021_00848_1 crossref_primary_10_1007_s00493_023_00063_2 crossref_primary_10_1016_j_ejc_2018_09_001 crossref_primary_10_1587_transinf_2021EDP7177 crossref_primary_10_1007_s00224_020_09967_8 crossref_primary_10_1002_jgt_22518 crossref_primary_10_1016_j_disc_2024_113966 crossref_primary_10_1080_23799927_2022_2118622 crossref_primary_10_1007_s00453_024_01263_y crossref_primary_10_1016_j_dam_2023_01_026 crossref_primary_10_1145_3715694 crossref_primary_10_4036_iis_2022_R_06 crossref_primary_10_1016_j_ejc_2021_103319 crossref_primary_10_1016_j_cosrev_2024_100663 crossref_primary_10_1016_j_disc_2019_111733 crossref_primary_10_1016_j_ipl_2018_12_006 crossref_primary_10_1007_s00373_020_02133_4 crossref_primary_10_1016_j_ejc_2023_103876 crossref_primary_10_1109_TQE_2020_3030609 crossref_primary_10_1016_j_jcss_2023_03_008 crossref_primary_10_1051_ro_2023134 crossref_primary_10_1016_j_dam_2021_05_014 crossref_primary_10_1007_s00453_024_01271_y crossref_primary_10_1137_23M1623690 crossref_primary_10_1007_s00453_023_01181_5 crossref_primary_10_1016_j_tcs_2021_01_009 crossref_primary_10_1016_j_tcs_2024_114682 crossref_primary_10_1016_j_disc_2022_113184 crossref_primary_10_1016_j_dam_2018_05_029 crossref_primary_10_1016_j_jcss_2024_103578 crossref_primary_10_1007_s10107_023_02025_4 crossref_primary_10_1137_21M1463598 crossref_primary_10_1016_j_jctb_2020_10_001 crossref_primary_10_1016_j_dam_2024_05_042 crossref_primary_10_1016_j_ipl_2024_106556 crossref_primary_10_1016_j_aam_2023_102556 crossref_primary_10_1016_j_comgeo_2022_101974 crossref_primary_10_1016_j_dam_2024_11_031 crossref_primary_10_1137_20M1364370 crossref_primary_10_1007_s00453_024_01261_0 crossref_primary_10_1587_transinf_2021FCP0010 crossref_primary_10_1002_jgt_23066 crossref_primary_10_1007_s00453_021_00909_5 crossref_primary_10_1016_j_tcs_2023_113863 crossref_primary_10_1002_jgt_22530 crossref_primary_10_1007_s00373_023_02677_1 crossref_primary_10_1007_s00453_024_01262_z crossref_primary_10_1016_j_tcs_2023_114196 |
| Cites_doi | 10.1016/j.dam.2012.05.014 10.1007/s00454-003-0006-7 10.1016/0095-8956(78)90042-4 10.1016/j.comgeo.2014.01.001 10.3390/a8030459 10.1007/978-3-662-47672-7_80 10.1016/j.comgeo.2014.11.001 10.1007/978-3-662-48971-0_21 10.1016/j.tcs.2017.11.013 10.1016/S0166-218X(01)00338-9 10.1007/s00454-018-0035-8 10.1016/0095-8956(74)90098-7 10.1016/S0095-8956(81)80014-7 10.1016/j.tcs.2005.05.008 10.1145/800133.804350 10.1109/SFCS.1984.715921 10.2307/2369492 10.1007/s00453-009-9290-7 10.1016/j.dam.2010.08.019 10.26493/1855-3974.196.0df 10.1016/j.ejc.2011.09.019 10.1007/s10878-012-9490-y 10.1016/j.endm.2013.10.040 10.1007/978-3-319-17142-5_19 10.1007/s00373-005-0640-1 10.1007/978-3-319-53925-6_36 10.1016/j.dam.2010.02.001 10.1002/jgt.21992 10.1007/978-3-319-13524-3_21 10.1016/j.tcs.2015.01.052 10.1137/07070440X 10.1587/transinf.2015FCP0010 10.1007/978-3-319-13524-3_10 10.1007/978-3-642-22670-0_1 10.2307/2267170 10.1007/s00373-013-1302-3 10.1016/j.disc.2017.03.007 10.26493/1855-3974.168.464 10.1007/PL00009259 10.7151/dmgt.1562 10.1016/j.tcs.2015.07.037 10.1007/978-3-319-68705-6_10 10.1007/978-3-319-08404-6_8 10.1016/j.tcs.2011.04.041 10.1007/s10878-012-9562-z 10.1007/s00224-016-9729-6 10.1093/acprof:oso/9780198566076.001.0001 10.1587/transfun.E98.A.1168 10.1002/rsa.3240070205 10.1007/978-3-319-53925-6_35 10.1137/16M1069171 10.1137/060652063 10.1007/978-3-319-13524-3_19 10.1002/jgt.21846 10.1002/rsa.20129 10.1016/j.ejc.2016.06.008 10.1007/978-3-319-71147-8_10 10.1016/j.tcs.2016.08.016 10.1609/aaai.v26i1.8128 10.1007/978-3-319-53925-6_27 10.4171/owr/2005/03 10.1007/978-3-319-21840-3_51 10.1002/jgt.22000 10.1007/s00373-011-1055-9 10.1016/j.tcs.2011.05.021 10.1007/978-3-319-30139-6_19 10.1007/978-3-7643-7400-6_22 10.1007/978-3-642-29344-3_52 10.1007/978-3-319-13075-0_36 10.1142/S1793830913500122 10.1016/j.tcs.2012.03.004 10.1007/978-3-319-21840-3_42 10.1007/s00453-015-0009-7 10.1007/s00373-017-1792-5 10.1016/j.tcs.2010.12.005 10.1016/j.tcs.2014.04.011 10.1587/transinf.E95.D.737 10.1016/j.disc.2007.07.028 10.5666/KMJ.2016.56.3.647 10.1007/978-3-319-03898-8_24 10.1007/978-3-662-55751-8_12 10.1089/106652703322539097 10.37236/7458 10.2307/2369235 10.1007/s10878-015-9947-x 10.1016/S0012-365X(98)00377-X 10.1016/j.tcs.2016.05.015 10.1002/net.10091 10.1016/j.jcss.2011.10.003 10.1007/978-3-319-62389-4_24 10.1016/j.tcs.2009.08.023 10.1007/978-3-319-53925-6_34 10.1002/jgt.20514 10.1007/978-3-662-48054-0_42 10.1007/978-3-642-32589-2_22 10.1017/S030500410002168X 10.1016/S0001-8708(77)80048-0 10.1007/s00453-016-0159-2 10.1002/jgt.20613 10.1016/j.ejc.2009.03.011 10.1016/B978-0-12-587260-7.50011-X 10.1109/12.21148 10.1016/0095-8956(90)90077-D 10.1016/j.disc.2018.07.007 10.1007/978-3-319-13075-0_17 10.1007/978-3-319-94776-1_36 10.1016/j.ejc.2015.08.001 10.1016/j.jcss.2017.11.003 10.1016/j.disc.2014.02.014 10.1016/j.disc.2016.03.003 |
| ContentType | Journal Article |
| Copyright | Copyright MDPI AG 2018 |
| Copyright_xml | – notice: Copyright MDPI AG 2018 |
| DBID | AAYXX CITATION 3V. 7SC 7TB 7XB 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V L7M L~C L~D M0N M7S P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PTHSS Q9U DOA |
| DOI | 10.3390/a11040052 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Database ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Database ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea Engineering Research Database ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Engineering Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition Engineering Collection ProQuest Central Basic DOAJ (Directory of Open Access Journals) |
| DatabaseTitle | CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1999-4893 |
| ExternalDocumentID | oai_doaj_org_article_21a7ca8ba2cb4ec38eaa5159704204e4 10_3390_a11040052 |
| GroupedDBID | 23M 2WC 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ABUWG ACUHS ADBBV AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS AMVHM ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO E3Z ESX GNUQQ GROUPED_DOAJ HCIFZ IAO ICD J9A K6V K7- KQ8 L6V M7S MODMG M~E OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS TR2 TUS 3V. 7SC 7TB 7XB 8AL 8FD 8FK FR3 JQ2 KR7 L7M L~C L~D M0N P62 PKEHL PQEST PQUKI Q9U PUEGO |
| ID | FETCH-LOGICAL-c354t-cb1b49b6478f346176f20a21236d18ba1e2d4800deca5b3a9e4efae3298480113 |
| IEDL.DBID | DOA |
| ISSN | 1999-4893 |
| IngestDate | Wed Aug 27 01:21:49 EDT 2025 Fri Jul 25 12:06:05 EDT 2025 Thu Apr 24 22:56:32 EDT 2025 Thu Jul 10 07:41:30 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c354t-cb1b49b6478f346176f20a21236d18ba1e2d4800deca5b3a9e4efae3298480113 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://doaj.org/article/21a7ca8ba2cb4ec38eaa5159704204e4 |
| PQID | 2041063470 |
| PQPubID | 2032439 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_21a7ca8ba2cb4ec38eaa5159704204e4 proquest_journals_2041063470 crossref_primary_10_3390_a11040052 crossref_citationtrail_10_3390_a11040052 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-04-19 |
| PublicationDateYYYYMMDD | 2018-04-19 |
| PublicationDate_xml | – month: 04 year: 2018 text: 2018-04-19 day: 19 |
| PublicationDecade | 2010 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Algorithms |
| PublicationYear | 2018 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | ref_93 Bertschi (ref_95) 1990; 50 ref_138 ref_90 Medvedev (ref_17) 2012; 439 ref_13 Ito (ref_4) 2011; 412 ref_12 ref_10 McDonald (ref_96) 2012; 70 ref_98 ref_133 Akers (ref_155) 1989; 38 Alikhani (ref_115) 2017; 33 ref_135 ref_134 ref_19 Bonamy (ref_84) 2014; 27 ref_15 Post (ref_48) 1947; 12 Belcastro (ref_97) 2014; 325 Haas (ref_106) 2012; 5 Suzuki (ref_127) 2016; 32 Connelly (ref_2) 2003; 30 Feghali (ref_99) 2017; 59 ref_129 Makino (ref_132) 2011; 412 ref_25 ref_24 ref_23 ref_22 ref_21 ref_122 ref_20 ref_124 ref_123 Fellows (ref_6) 2012; 78 Pilz (ref_137) 2014; 47 Cayley (ref_158) 1849; 34 Monroy (ref_109) 2012; 28 ref_29 ref_27 Parberry (ref_148) 2015; 8 ref_72 ref_71 Ito (ref_28) 2016; 99-D Wu (ref_141) 2010; 158 Archetti (ref_9) 2003; 42 Heath (ref_161) 2003; 10 ref_151 ref_79 ref_150 ref_77 ref_76 ref_75 ref_154 ref_74 Fatehi (ref_108) 2017; 18 ref_157 ref_73 ref_156 (ref_125) 2015; 29 Wilson (ref_147) 1974; 16 Garnero (ref_26) 2018; 711 Gopalan (ref_34) 2009; 38 Johnson (ref_87) 2016; 75 Schwerdtfeger (ref_130) 2014; 8 Celaya (ref_111) 2016; 56 ref_149 Demaine (ref_59) 2015; 600 Lakshmanan (ref_120) 2010; 7 Wrochna (ref_47) 2018; 93 ref_140 ref_88 ref_143 Hearn (ref_16) 2005; 343 ref_146 ref_145 Johnson (ref_3) 1879; 2 Hatanaka (ref_44) 2015; 98-A Dumitrescu (ref_144) 2006; 22 ref_58 ref_57 ref_56 Cereceda (ref_78) 2009; 30 ref_55 ref_54 Dyer (ref_83) 2006; 29 Medvedev (ref_18) 2011; 412 Bonsma (ref_42) 2016; 83 ref_53 Yamanaka (ref_139) 2015; 586 ref_52 ref_51 Haas (ref_114) 2014; 30 Ahuja (ref_5) 2002; 123 Kempe (ref_89) 1879; 2 Haas (ref_128) 2017; 340 Ito (ref_37) 2014; 544 Makino (ref_131) 2010; 158 ref_61 ref_60 ref_69 Meyniel (ref_92) 1978; 24 ref_162 ref_68 ref_67 ref_164 ref_66 ref_65 ref_166 ref_64 ref_165 ref_63 Vergnas (ref_94) 1981; 31 ref_62 Goraly (ref_153) 2010; 58 ref_167 Brooks (ref_80) 1941; 37 Sridharan (ref_121) 2009; 69 Pak (ref_159) 1999; 204 Bonamy (ref_85) 2013; 44 Jerrum (ref_82) 1995; 7 Alamdari (ref_1) 2017; 46 Ito (ref_100) 2012; 95-D Fricke (ref_117) 2011; 31 Brewster (ref_101) 2015; 80 ref_119 ref_118 Feghali (ref_81) 2016; 83 Choo (ref_110) 2011; 4 Bonsma (ref_35) 2009; 410 ref_33 Mans (ref_11) 2017; 60 ref_112 Yasui (ref_160) 2015; 2015-AL-153 ref_39 ref_38 Cereceda (ref_31) 2008; 308 Ito (ref_36) 2012; 160 ref_104 Connelly (ref_126) 2010; 8 ref_103 Lubiw (ref_136) 2015; 49 ref_105 Auletta (ref_152) 1999; 23 (ref_14) 2013; Volume 409 ref_107 Fujita (ref_163) 2012; 33 Cereceda (ref_32) 2011; 67 Mouawad (ref_70) 2017; 78 ref_46 ref_45 ref_43 Fisk (ref_91) 1977; 24 Bousquet (ref_86) 2016; 52 ref_41 ref_40 Beier (ref_113) 2016; 339 Brewster (ref_102) 2016; 639 Dumitrescu (ref_142) 2008; 22 ref_49 Ito (ref_30) 2014; 28 Haddadan (ref_50) 2016; 651 ref_8 Subramanian (ref_116) 2008; 5 ref_7 |
| References_xml | – volume: 160 start-page: 2199 year: 2012 ident: ref_36 article-title: Reconfiguration of list edge-colorings in a graph publication-title: Discret. Appl. Math. doi: 10.1016/j.dam.2012.05.014 – volume: 30 start-page: 205 year: 2003 ident: ref_2 article-title: Blowing Up Polygonal Linkages publication-title: Discret. Comput. Geom. doi: 10.1007/s00454-003-0006-7 – ident: ref_51 – volume: 24 start-page: 251 year: 1978 ident: ref_92 article-title: Les 5-colorations d’un graphe planaire forment une classe de commutation unique publication-title: J. Comb. Theory Ser. B doi: 10.1016/0095-8956(78)90042-4 – volume: 47 start-page: 589 year: 2014 ident: ref_137 article-title: Flip distance between triangulations of a planar point set is APX-hard publication-title: Comput. Geom. doi: 10.1016/j.comgeo.2014.01.001 – volume: 8 start-page: 459 year: 2015 ident: ref_148 article-title: Solving the (n2 - 1)-Puzzle with 8/3 n3 Expected Moves publication-title: Algorithms doi: 10.3390/a8030459 – ident: ref_133 doi: 10.1007/978-3-662-47672-7_80 – volume: 49 start-page: 17 year: 2015 ident: ref_136 article-title: Flip distance between two triangulations of a point set is NP-complete publication-title: Comput. Geom. doi: 10.1016/j.comgeo.2014.11.001 – ident: ref_65 – ident: ref_88 – ident: ref_60 doi: 10.1007/978-3-662-48971-0_21 – volume: 711 start-page: 66 year: 2018 ident: ref_26 article-title: Fixing improper colorings of graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2017.11.013 – volume: 123 start-page: 75 year: 2002 ident: ref_5 article-title: A survey of very large-scale neighborhood search techniques publication-title: Discret. Appl. Math. doi: 10.1016/S0166-218X(01)00338-9 – ident: ref_123 – ident: ref_71 – ident: ref_146 – ident: ref_145 doi: 10.1007/s00454-018-0035-8 – volume: 16 start-page: 86 year: 1974 ident: ref_147 article-title: Graph puzzles, homotopy, and the alternating group publication-title: J. Comb. Theory Ser. B doi: 10.1016/0095-8956(74)90098-7 – volume: 31 start-page: 95 year: 1981 ident: ref_94 article-title: Kempe classes and the Hadwiger Conjecture publication-title: J. Comb. Theory Ser. B doi: 10.1016/S0095-8956(81)80014-7 – ident: ref_77 – ident: ref_166 – volume: 343 start-page: 72 year: 2005 ident: ref_16 article-title: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.05.008 – ident: ref_129 doi: 10.1145/800133.804350 – ident: ref_151 doi: 10.1109/SFCS.1984.715921 – volume: 2 start-page: 397 year: 1879 ident: ref_3 article-title: Notes on the “15” Puzzle publication-title: Am. J. Math. doi: 10.2307/2369492 – volume: 58 start-page: 610 year: 2010 ident: ref_153 article-title: Multi-Color Pebble Motion on Graphs publication-title: Algorithmica doi: 10.1007/s00453-009-9290-7 – volume: 158 start-page: 2024 year: 2010 ident: ref_131 article-title: On the Boolean connectivity problem for Horn relations publication-title: Discret. Appl. Math. doi: 10.1016/j.dam.2010.08.019 – volume: 4 start-page: 125 year: 2011 ident: ref_110 article-title: Gray code numbers for graphs publication-title: Ars Math. Contemp. doi: 10.26493/1855-3974.196.0df – volume: 33 start-page: 884 year: 2012 ident: ref_163 article-title: Colored pebble motion on graphs publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2011.09.019 – volume: 27 start-page: 132 year: 2014 ident: ref_84 article-title: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs publication-title: J. Comb. Optim. doi: 10.1007/s10878-012-9490-y – ident: ref_13 – ident: ref_45 – ident: ref_103 – volume: Volume 409 start-page: 127 year: 2013 ident: ref_14 article-title: The complexity of change publication-title: Surveys in Combinatorics 2013 – volume: 44 start-page: 257 year: 2013 ident: ref_85 article-title: Recoloring bounded treewidth graphs publication-title: Electron. Notes Discret. Math. doi: 10.1016/j.endm.2013.10.040 – ident: ref_27 doi: 10.1007/978-3-319-17142-5_19 – ident: ref_149 – volume: 22 start-page: 37 year: 2006 ident: ref_144 article-title: Pushing Squares Around publication-title: Graphs Comb. doi: 10.1007/s00373-005-0640-1 – ident: ref_53 – ident: ref_61 doi: 10.1007/978-3-319-53925-6_36 – volume: 158 start-page: 1017 year: 2010 ident: ref_141 article-title: Feasibility of motion planning on acyclic and strongly connected directed graphs publication-title: Discret. Appl. Math. doi: 10.1016/j.dam.2010.02.001 – volume: 83 start-page: 164 year: 2016 ident: ref_42 article-title: Independent Set Reconfiguration in Cographs and their Generalizations publication-title: J. Graph Theory doi: 10.1002/jgt.21992 – ident: ref_140 – ident: ref_49 doi: 10.1007/978-3-319-13524-3_21 – ident: ref_134 – volume: 586 start-page: 81 year: 2015 ident: ref_139 article-title: Swapping labeled tokens on graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2015.01.052 – ident: ref_157 – volume: 38 start-page: 2330 year: 2009 ident: ref_34 article-title: The connectivity of Boolean satisfiability: Computational and structural dichotomies publication-title: SIAM J. Comput. doi: 10.1137/07070440X – volume: 34 start-page: 527 year: 1849 ident: ref_158 article-title: LXXVII. Note on the theory of permutations publication-title: Philos. Mag. – volume: 99-D start-page: 598 year: 2016 ident: ref_28 article-title: Reconfiguration of Vertex Covers in a Graph publication-title: IEICE Trans. doi: 10.1587/transinf.2015FCP0010 – ident: ref_79 doi: 10.1007/978-3-319-13524-3_10 – ident: ref_150 doi: 10.1007/978-3-642-22670-0_1 – volume: 12 start-page: 1 year: 1947 ident: ref_48 article-title: Recursive unsolvability of a problem of Thue publication-title: J. Symb. Log. doi: 10.2307/2267170 – volume: 30 start-page: 609 year: 2014 ident: ref_114 article-title: The k-Dominating Graph publication-title: Graphs Comb. doi: 10.1007/s00373-013-1302-3 – volume: 340 start-page: 1802 year: 2017 ident: ref_128 article-title: Reconfiguring dominating sets in some well-covered and other classes of graphs publication-title: Discret. Math. doi: 10.1016/j.disc.2017.03.007 – volume: 5 start-page: 149 year: 2012 ident: ref_106 article-title: The canonical coloring graph of trees and cycles publication-title: Ars Math. Contemp. doi: 10.26493/1855-3974.168.464 – ident: ref_75 – volume: 29 start-page: 25 year: 2015 ident: ref_125 article-title: Gamma graphs of some special classes of trees publication-title: Ann. Math. Sil. – volume: 23 start-page: 223 year: 1999 ident: ref_152 article-title: A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees publication-title: Algorithmica doi: 10.1007/PL00009259 – ident: ref_25 – volume: 31 start-page: 517 year: 2011 ident: ref_117 article-title: γ-graphs of graphs publication-title: Discuss. Math. Graph Theory doi: 10.7151/dmgt.1562 – volume: 600 start-page: 132 year: 2015 ident: ref_59 article-title: Linear-time algorithm for sliding tokens on trees publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2015.07.037 – volume: 7 start-page: 53 year: 2010 ident: ref_120 article-title: The gamma graph of a graph publication-title: AKCE Int. J. Graphs Comb. – ident: ref_56 doi: 10.1007/978-3-319-68705-6_10 – ident: ref_57 doi: 10.1007/978-3-319-08404-6_8 – ident: ref_112 – volume: 412 start-page: 4613 year: 2011 ident: ref_132 article-title: An exact algorithm for the Boolean connectivity problem for k-CNF publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2011.04.041 – volume: 28 start-page: 639 year: 2014 ident: ref_30 article-title: Approximability of the subset sum reconfiguration problem publication-title: J. Comb. Optim. doi: 10.1007/s10878-012-9562-z – volume: 69 start-page: 231 year: 2009 ident: ref_121 article-title: Trees and unicyclic graphs are γ-graphs publication-title: J. Comb. Math. Comb. Comput. – ident: ref_64 – volume: 8 start-page: 173 year: 2014 ident: ref_130 article-title: A Computational Trichotomy for Connectivity of Boolean Satisfiability publication-title: J. Satisf. Boolean Model. Comput. – ident: ref_154 – volume: 60 start-page: 3 year: 2017 ident: ref_11 article-title: Incremental Problems in the Parameterized Complexity Setting publication-title: Theory Comput. Syst. doi: 10.1007/s00224-016-9729-6 – ident: ref_19 – ident: ref_67 doi: 10.1093/acprof:oso/9780198566076.001.0001 – volume: 5 start-page: 17 year: 2008 ident: ref_116 article-title: γ-graph of a graph publication-title: Bull. Kerala Math. Assoc. – volume: 98-A start-page: 1168 year: 2015 ident: ref_44 article-title: The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs publication-title: IEICE Trans. doi: 10.1587/transfun.E98.A.1168 – volume: 7 start-page: 157 year: 1995 ident: ref_82 article-title: A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph publication-title: Random Struct. Algorithms doi: 10.1002/rsa.3240070205 – ident: ref_164 doi: 10.1007/978-3-319-53925-6_35 – volume: 46 start-page: 824 year: 2017 ident: ref_1 article-title: How to Morph Planar Graph Drawings publication-title: SIAM J. Comput. doi: 10.1137/16M1069171 – volume: 22 start-page: 124 year: 2008 ident: ref_142 article-title: Reconfigurations in Graphs and Grids publication-title: SIAM J. Discret. Math. doi: 10.1137/060652063 – ident: ref_55 – ident: ref_33 doi: 10.1007/978-3-319-13524-3_19 – volume: 80 start-page: 173 year: 2015 ident: ref_101 article-title: Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings publication-title: J. Graph Theory doi: 10.1002/jgt.21846 – ident: ref_62 doi: 10.1007/978-3-319-53925-6_36 – volume: 29 start-page: 450 year: 2006 ident: ref_83 article-title: Randomly coloring sparse random graphs with fewer colors than the maximum degree publication-title: Random Struct. Algorithms doi: 10.1002/rsa.20129 – ident: ref_90 – volume: 59 start-page: 1 year: 2017 ident: ref_99 article-title: Kempe equivalence of colourings of cubic graphs publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2016.06.008 – ident: ref_167 doi: 10.1007/978-3-319-71147-8_10 – volume: 651 start-page: 37 year: 2016 ident: ref_50 article-title: The complexity of dominating set reconfiguration publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.08.016 – ident: ref_104 – ident: ref_7 doi: 10.1609/aaai.v26i1.8128 – ident: ref_98 – ident: ref_40 doi: 10.1007/978-3-319-53925-6_27 – ident: ref_118 – ident: ref_8 – ident: ref_41 doi: 10.4171/owr/2005/03 – ident: ref_162 doi: 10.1007/978-3-319-21840-3_51 – ident: ref_52 – volume: 83 start-page: 340 year: 2016 ident: ref_81 article-title: A Reconfigurations Analogue of Brooks’ Theorem and Its Consequences publication-title: J. Graph Theory doi: 10.1002/jgt.22000 – volume: 28 start-page: 365 year: 2012 ident: ref_109 article-title: Token Graphs publication-title: Graphs Comb. doi: 10.1007/s00373-011-1055-9 – ident: ref_69 – volume: 412 start-page: 5205 year: 2011 ident: ref_18 article-title: Shortest paths between shortest paths publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2011.05.021 – ident: ref_58 doi: 10.1007/978-3-319-30139-6_19 – volume: 8 start-page: 23 year: 2010 ident: ref_126 article-title: A note on γ-Graphs publication-title: AKCE Int. J. Graphs Comb. – ident: ref_156 – ident: ref_93 doi: 10.1007/978-3-7643-7400-6_22 – ident: ref_10 doi: 10.1007/978-3-642-29344-3_52 – ident: ref_54 doi: 10.1007/978-3-319-13075-0_36 – ident: ref_122 doi: 10.1142/S1793830913500122 – ident: ref_66 – volume: 439 start-page: 9 year: 2012 ident: ref_17 article-title: Complexity of independent set reconfigurability problems publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2012.03.004 – ident: ref_74 doi: 10.1007/978-3-319-21840-3_42 – ident: ref_38 – volume: 75 start-page: 295 year: 2016 ident: ref_87 article-title: Finding Shortest Paths Between Graph Colourings publication-title: Algorithmica doi: 10.1007/s00453-015-0009-7 – volume: 33 start-page: 665 year: 2017 ident: ref_115 article-title: On the Structure of Dominating Graphs publication-title: Graphs Comb. doi: 10.1007/s00373-017-1792-5 – volume: 412 start-page: 1054 year: 2011 ident: ref_4 article-title: On the complexity of reconfiguration problems publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.12.005 – volume: 544 start-page: 84 year: 2014 ident: ref_37 article-title: Reconfiguration of list L(2,1)-labelings in a graph publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2014.04.011 – ident: ref_124 – ident: ref_20 – volume: 95-D start-page: 737 year: 2012 ident: ref_100 article-title: An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree publication-title: IEICE Trans. doi: 10.1587/transinf.E95.D.737 – volume: 308 start-page: 913 year: 2008 ident: ref_31 article-title: Connectedness of the graph of vertex-colourings publication-title: Discret. Math. doi: 10.1016/j.disc.2007.07.028 – volume: 56 start-page: 647 year: 2016 ident: ref_111 article-title: Reconfiguring k-colourings of complete bipartite graphs publication-title: Kyungpook Math. J. doi: 10.5666/KMJ.2016.56.3.647 – ident: ref_119 – volume: 2015-AL-153 start-page: 1 year: 2015 ident: ref_160 article-title: Swapping Labeled Tokens on Complete Split Graphs publication-title: Inf. Process. Soc. Jpn. SIG Tech. Rep. – ident: ref_68 doi: 10.1007/978-3-319-03898-8_24 – ident: ref_73 doi: 10.1007/978-3-662-55751-8_12 – ident: ref_24 – volume: 10 start-page: 775 year: 2003 ident: ref_161 article-title: Sorting by Short Swaps publication-title: J. Comput. Biol. doi: 10.1089/106652703322539097 – ident: ref_76 doi: 10.37236/7458 – ident: ref_138 – volume: 2 start-page: 193 year: 1879 ident: ref_89 article-title: On the geographical problem of the four colours publication-title: Am. J. Math. doi: 10.2307/2369235 – volume: 32 start-page: 1182 year: 2016 ident: ref_127 article-title: Reconfiguration of dominating sets publication-title: J. Comb. Optim. doi: 10.1007/s10878-015-9947-x – volume: 204 start-page: 329 year: 1999 ident: ref_159 article-title: Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees publication-title: Discret. Math. doi: 10.1016/S0012-365X(98)00377-X – volume: 639 start-page: 1 year: 2016 ident: ref_102 article-title: A dichotomy theorem for circular colouring reconfiguration publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.05.015 – volume: 42 start-page: 154 year: 2003 ident: ref_9 article-title: Reoptimizing the traveling salesman problem publication-title: Networks doi: 10.1002/net.10091 – ident: ref_63 – volume: 78 start-page: 707 year: 2012 ident: ref_6 article-title: Local Search: Is Brute-force Avoidable? publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2011.10.003 – ident: ref_165 doi: 10.1007/978-3-319-62389-4_24 – ident: ref_21 – volume: 410 start-page: 5215 year: 2009 ident: ref_35 article-title: Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2009.08.023 – ident: ref_143 doi: 10.1007/978-3-319-53925-6_34 – volume: 67 start-page: 69 year: 2011 ident: ref_32 article-title: Finding paths between 3-colorings publication-title: J. Graph Theory doi: 10.1002/jgt.20514 – ident: ref_23 doi: 10.1007/978-3-662-48054-0_42 – ident: ref_39 doi: 10.1007/978-3-642-32589-2_22 – volume: 37 start-page: 194 year: 1941 ident: ref_80 article-title: On colouring the nodes of a network publication-title: Math. Proc. Camb. Philos. Soc. doi: 10.1017/S030500410002168X – volume: 24 start-page: 298 year: 1977 ident: ref_91 article-title: Geometric coloring theory publication-title: Adv. Math. doi: 10.1016/S0001-8708(77)80048-0 – volume: 78 start-page: 274 year: 2017 ident: ref_70 article-title: On the Parameterized Complexity of Reconfiguration Problems publication-title: Algorithmica doi: 10.1007/s00453-016-0159-2 – volume: 70 start-page: 226 year: 2012 ident: ref_96 article-title: Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs publication-title: J. Graph Theory doi: 10.1002/jgt.20613 – volume: 18 start-page: 45 year: 2017 ident: ref_108 article-title: The k-independent graph of a graph publication-title: Adv. Appl. Discret. Math. – ident: ref_29 – volume: 30 start-page: 1593 year: 2009 ident: ref_78 article-title: Mixing 3-colourings in bipartite graphs publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2009.03.011 – ident: ref_46 – ident: ref_12 – ident: ref_135 doi: 10.1016/B978-0-12-587260-7.50011-X – volume: 38 start-page: 555 year: 1989 ident: ref_155 article-title: A Group-Theoretic Model for Symmetric Interconnection Networks publication-title: IEEE Trans. Comput. doi: 10.1109/12.21148 – volume: 50 start-page: 222 year: 1990 ident: ref_95 article-title: Perfectly contractile graphs publication-title: J. Comb. Theory Ser. B doi: 10.1016/0095-8956(90)90077-D – ident: ref_107 doi: 10.1016/j.disc.2018.07.007 – ident: ref_15 – ident: ref_72 doi: 10.1007/978-3-319-13075-0_17 – ident: ref_43 – ident: ref_105 – ident: ref_22 doi: 10.1007/978-3-319-94776-1_36 – volume: 52 start-page: 1 year: 2016 ident: ref_86 article-title: Fast recoloring of sparse graphs publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2015.08.001 – volume: 93 start-page: 1 year: 2018 ident: ref_47 article-title: Reconfiguration in bounded bandwidth and tree-depth publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2017.11.003 – volume: 325 start-page: 77 year: 2014 ident: ref_97 article-title: Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs publication-title: Discret. Math. doi: 10.1016/j.disc.2014.02.014 – volume: 339 start-page: 2100 year: 2016 ident: ref_113 article-title: Classifying coloring graphs publication-title: Discret. Math. doi: 10.1016/j.disc.2016.03.003 |
| SSID | ssj0065961 |
| Score | 2.4829462 |
| Snippet | Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of... |
| SourceID | doaj proquest crossref |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database |
| StartPage | 52 |
| SubjectTerms | algorithms complexity Graph theory Graphical representations Reconfiguration reconfiguration problems Solution space |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LT8MwDLZgu3DhjRgMqBAHLhVNkybpCTG0aXCYEGLSblVenZBQO7bu_5O06RACcW19iR3bn53kM8BNzoxUifU0TakOiUFpKCKpQsHjXJNUmUjUbJ8TOp6S51ky8w23lb9W2cbEOlDrUrkeuS3Sia1eMGHR_eIzdFOj3OmqH6GxDV0bgjnvQHcwnLy8trGYJilFDZ8QtsX9nbDJjrhO6I8sVJP1_4rFdYIZ7cOuR4bBQ2PKA9gyxSHstVMXAu-ER3D15C6X64b1NajKwFWQRf4-XzfGPIbpaPj2OA79mINQ4YRUoZJIklS6R585JhZR0DyOhEspVCMuBTKxJhbXaaNEIrFIDTG5MDhOueN-QfgEOkVZmFMIKIukdUgTsfqNu4VTlFHDuMYk11qwHty2y86U5wB3oyg-MlsLOA1lGw314HojumiIL_4SGjjdbQQcV3X9oVzOM7_1sxgJpoRdSKwkMQpzI4RDUczGi4gY0oN-q_nMO9Aq-zb32f-_z2HHYhjuDnhQ2odOtVybC4sTKnnpN8MXxs-7xA priority: 102 providerName: ProQuest |
| Title | Introduction to Reconfiguration |
| URI | https://www.proquest.com/docview/2041063470 https://doaj.org/article/21a7ca8ba2cb4ec38eaa5159704204e4 |
| Volume | 11 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEB60Xrz4Fqu1BvHgJTSb3ewmR5XW6qGIWOgt7GMigrSi6f93No-iKHjxmgwkO7Oz3zfJ7jcAF4VCYxPKNCelCwWyLNSRsaFO48KJzGKkK7XPiRxPxf0smX1p9eX3hNXywLXjBjHTyurU6NgagZanqLXHYEWzLRJYKYES5rXFVL0GyySTrNYR4lTUDzSBnPBfQL-hTyXS_2MNroBltANbDSMMruo32YU1nO_BdtttIWiSbx_O7vymclervQblIvCV47x4eV7WQTyA6Wj4dDMOm_YGoeWJKENrmBGZ8Yc9Cy6IScgijrSHEukYDZhh7ATxOYdWJ4brDAUWGnmcpV7zhfFD6MwXczyCQKrIUCJipKqz7USjpJKoUsdF4ZxWXbhsh53bRvvbt6B4zakG8B7KVx7qwvnK9K0WvPjN6Nr7bmXgNaqrCxS5vIlc_lfkutBrPZ83ifOR0x0qUrlQ0fF_POMENonhpP73D8t60Cnfl3hKLKI0fVhPR7d92LgeTh4e-9X0-QRH4MXK |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEB6VcCgX3qgppbVQkbhY2N71rn1ACCghoWlOjZSbu49xVKmKS-Oq4k_xG5nxIxWi4tard7TSjOe5u_MNwGGp0bqULM0r5UOJcR6ayLrQZEnpZe4wMg3a50yN5_LHIl1swe--F4afVfY-sXHUvnJ8Rk5FuqTqRUgdfbr8GfLUKL5d7UdotGpxjL9uqGRbf5wc0f99lySjb6dfx2E3VSB0IpV16GxsZW65x7IUkgK4KpPIsAdXPs6siTHxktIoj86kVpgcJZYGRZJnDLUSC9r3ATyUgiI5d6aPvveeX6W5ilv0IlqMPhgKrZLPXf-Kec1ogH88fxPORk_hcZeHBp9bxXkGW7h6Dk_6GQ9BZ_Iv4GDCT9l9izEb1FXA9eqqPF9et6rzEub3wv4rGKyqFe5AoHRkyfwx0k1HPSVvSivUmRey9N7oIbzv2S5chzjOgy8uCqo8WELFRkJDeLshvWxhNu4i-sKy2xAwMnbzobpaFp2hFUlstDPESOKsRCcyNIZzNk3eKZIoh7DXS77ozHVd3CrX7v-XD2B7fHoyLaaT2fFreETZU8ZXS3G-B4P66hrfUIZS2_1GLQI4u289_APno_Z- |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LSxxBEC50heAlMT5wEx-DJOBl2Jnpnu6Zg4i6Lq7KIqLgbexHjQTCrtGVkL-WX2fVPFaCkpvXmWKga756dXd9BfCt1GhdSpbmlfKhxDgPTWRdaLKk9DJ3GJmK7XOkTq7l6U16Mwd_214YvlbZ-sTKUfuJ4z1yKtIlVS9C6qhXNtciLvqD_ftfIU-Q4pPWdpxGDZEz_PObyrfHvWGf_vX3JBkcXx2dhM2EgdCJVE5DZ2Mrc8v9lqWQFMxVmUSGvbnycWZNjImXlFJ5dCa1wuQosTQokjxj2pVY0HfnYUFzVdSBhcPj0cVlGwdUmqu45jISIo96hgKt5F3YfyJgNSjgVRyogttgCT42WWlwUMPoM8zheBk-tRMfgsYBrMD2kC-2-5pxNphOAq5ex-WPu6caSKtw_S4KWIPOeDLGdQiUjiw5A4x01V9PqZzSCnXmhSy9N7oLu-2yC9fwj_MYjJ8F1SGsoWKmoS7szETva9KNt4QOWXczAebJrh5MHu6KxuyKJDbaGVpI4qxEJzI0hjM4Tb4qkii7sNFqvmiM97F4gdqX_7_ehg-EweJ8ODr7CouUSmV8zhTnG9CZPjzhJqUrU7vV4CKA2_eG4jN36_wQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Introduction+to+Reconfiguration&rft.jtitle=Algorithms&rft.au=Nishimura%2C+Naomi&rft.date=2018-04-19&rft.issn=1999-4893&rft.eissn=1999-4893&rft.volume=11&rft.issue=4&rft.spage=52&rft_id=info:doi/10.3390%2Fa11040052&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_a11040052 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1999-4893&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1999-4893&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1999-4893&client=summon |