Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity
We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type. [PUBLICATION ABSTRACT]
Gespeichert in:
| Veröffentlicht in: | Graphs and combinatorics 2007-06, Vol.23 (S1), p.195-208 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 208 |
|---|---|
| container_issue | S1 |
| container_start_page | 195 |
| container_title | Graphs and combinatorics |
| container_volume | 23 |
| creator | Demaine, Erik D. Demaine, Martin L. |
| description | We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type. [PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1007/s00373-007-0713-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_207356906</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1298848031</sourcerecordid><originalsourceid>FETCH-LOGICAL-c381t-b85d195e6b1a8e9319a321a5a44200463f2ff9cb4463d6410449bde4ac159083</originalsourceid><addsrcrecordid>eNotkMtOwzAQAC0EEqXwAdwszjXsxnYSc0NReamIHHq3HMcpKWlc4lSQfj0p5bSj1WhXGkKuEW4RILkLADzhbEQGCXImTsgEBZdMKhSnZAIKkQGiOicXIawBQKKACclf61Uw3zTf7feNCzM6L1eOvpneftTtakZNW9LcN4Pf1K2nubGf4_qeZr5tne1r34Y_JfObbeN-6n64JGeVaYK7-p9TsnycL7Nntnh_eskeFszyFHtWpLJEJV1coEmd4qgMj9BII0QEIGJeRVWlbCFGLGOBIIQqSieMRakg5VNyczy77fzXzoVer_2ua8ePOoKEy1hBPEp4lGznQ-hcpbddvTHdoBH0IZs-ZtMHPGTTgv8CRRpenQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>207356906</pqid></control><display><type>article</type><title>Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity</title><source>Springer Nature - Complete Springer Journals</source><creator>Demaine, Erik D. ; Demaine, Martin L.</creator><creatorcontrib>Demaine, Erik D. ; Demaine, Martin L.</creatorcontrib><description>We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 0911-0119</identifier><identifier>EISSN: 1435-5914</identifier><identifier>DOI: 10.1007/s00373-007-0713-4</identifier><language>eng</language><publisher>Tokyo: Springer Nature B.V</publisher><subject>Geometry ; Graph theory ; Mathematics ; Puzzles</subject><ispartof>Graphs and combinatorics, 2007-06, Vol.23 (S1), p.195-208</ispartof><rights>Springer-Verlag Tokyo 2007</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c381t-b85d195e6b1a8e9319a321a5a44200463f2ff9cb4463d6410449bde4ac159083</citedby><cites>FETCH-LOGICAL-c381t-b85d195e6b1a8e9319a321a5a44200463f2ff9cb4463d6410449bde4ac159083</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Demaine, Erik D.</creatorcontrib><creatorcontrib>Demaine, Martin L.</creatorcontrib><title>Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity</title><title>Graphs and combinatorics</title><description>We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type. [PUBLICATION ABSTRACT]</description><subject>Geometry</subject><subject>Graph theory</subject><subject>Mathematics</subject><subject>Puzzles</subject><issn>0911-0119</issn><issn>1435-5914</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNotkMtOwzAQAC0EEqXwAdwszjXsxnYSc0NReamIHHq3HMcpKWlc4lSQfj0p5bSj1WhXGkKuEW4RILkLADzhbEQGCXImTsgEBZdMKhSnZAIKkQGiOicXIawBQKKACclf61Uw3zTf7feNCzM6L1eOvpneftTtakZNW9LcN4Pf1K2nubGf4_qeZr5tne1r34Y_JfObbeN-6n64JGeVaYK7-p9TsnycL7Nntnh_eskeFszyFHtWpLJEJV1coEmd4qgMj9BII0QEIGJeRVWlbCFGLGOBIIQqSieMRakg5VNyczy77fzXzoVer_2ua8ePOoKEy1hBPEp4lGznQ-hcpbddvTHdoBH0IZs-ZtMHPGTTgv8CRRpenQ</recordid><startdate>200706</startdate><enddate>200706</enddate><creator>Demaine, Erik D.</creator><creator>Demaine, Martin L.</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200706</creationdate><title>Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity</title><author>Demaine, Erik D. ; Demaine, Martin L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c381t-b85d195e6b1a8e9319a321a5a44200463f2ff9cb4463d6410449bde4ac159083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Geometry</topic><topic>Graph theory</topic><topic>Mathematics</topic><topic>Puzzles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Demaine, Erik D.</creatorcontrib><creatorcontrib>Demaine, Martin L.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Graphs and combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Demaine, Erik D.</au><au>Demaine, Martin L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity</atitle><jtitle>Graphs and combinatorics</jtitle><date>2007-06</date><risdate>2007</risdate><volume>23</volume><issue>S1</issue><spage>195</spage><epage>208</epage><pages>195-208</pages><issn>0911-0119</issn><eissn>1435-5914</eissn><abstract>We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type. [PUBLICATION ABSTRACT]</abstract><cop>Tokyo</cop><pub>Springer Nature B.V</pub><doi>10.1007/s00373-007-0713-4</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0911-0119 |
| ispartof | Graphs and combinatorics, 2007-06, Vol.23 (S1), p.195-208 |
| issn | 0911-0119 1435-5914 |
| language | eng |
| recordid | cdi_proquest_journals_207356906 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Geometry Graph theory Mathematics Puzzles |
| title | Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T11%3A27%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Jigsaw%20Puzzles,%20Edge%20Matching,%20and%20Polyomino%20Packing:%20Connections%20and%20Complexity&rft.jtitle=Graphs%20and%20combinatorics&rft.au=Demaine,%20Erik%20D.&rft.date=2007-06&rft.volume=23&rft.issue=S1&rft.spage=195&rft.epage=208&rft.pages=195-208&rft.issn=0911-0119&rft.eissn=1435-5914&rft_id=info:doi/10.1007/s00373-007-0713-4&rft_dat=%3Cproquest_cross%3E1298848031%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=207356906&rft_id=info:pmid/&rfr_iscdi=true |