MaxCut on Permutation Graphs is NP-complete
In this paper, we prove that the MaxCut problem is NP-complete on permutation graphs, settling a long-standing open problem that appeared in the 1985 column of the "Ongoing Guide to NP-completeness" by David S. Johnson.
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | de Figueiredo, Celina M. H de Melo, Alexsander A Oliveira, Fabiano S Silva, Ana |
| description | In this paper, we prove that the MaxCut problem is NP-complete on permutation
graphs, settling a long-standing open problem that appeared in the 1985 column
of the "Ongoing Guide to NP-completeness" by David S. Johnson. |
| doi_str_mv | 10.48550/arxiv.2202.13955 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2202_13955</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2202_13955</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-7e51daa74b4ae9af65cabbedde4005de1d6c2b9110813ec67e3d806302e73c013</originalsourceid><addsrcrecordid>eNotzjsPgjAUhuEuDkb9AU6yG_C0pS2MhnhLvA3u5NAeI4koKWj033udvnf68jA25BDFiVIwQf8o75EQICIuU6W6bLzBR3Zrg-sl2JOvbi225bsXHutTE5RNsN2H9lrVZ2qpzzpHPDc0-G-PHeazQ7YM17vFKpuuQ9RGhYYUd4gmLmKkFI9aWSwKco5iAOWIO21FkXIOCZdktSHpEtASBBlpgcseG_1uv9q89mWF_pl_1PlXLV-18zwd</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>MaxCut on Permutation Graphs is NP-complete</title><source>arXiv.org</source><creator>de Figueiredo, Celina M. H ; de Melo, Alexsander A ; Oliveira, Fabiano S ; Silva, Ana</creator><creatorcontrib>de Figueiredo, Celina M. H ; de Melo, Alexsander A ; Oliveira, Fabiano S ; Silva, Ana</creatorcontrib><description>In this paper, we prove that the MaxCut problem is NP-complete on permutation
graphs, settling a long-standing open problem that appeared in the 1985 column
of the "Ongoing Guide to NP-completeness" by David S. Johnson.</description><identifier>DOI: 10.48550/arxiv.2202.13955</identifier><language>eng</language><subject>Computer Science - Computational Complexity ; Computer Science - Discrete Mathematics ; Mathematics - Combinatorics</subject><creationdate>2022-02</creationdate><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2202.13955$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2202.13955$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>de Figueiredo, Celina M. H</creatorcontrib><creatorcontrib>de Melo, Alexsander A</creatorcontrib><creatorcontrib>Oliveira, Fabiano S</creatorcontrib><creatorcontrib>Silva, Ana</creatorcontrib><title>MaxCut on Permutation Graphs is NP-complete</title><description>In this paper, we prove that the MaxCut problem is NP-complete on permutation
graphs, settling a long-standing open problem that appeared in the 1985 column
of the "Ongoing Guide to NP-completeness" by David S. Johnson.</description><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Discrete Mathematics</subject><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzjsPgjAUhuEuDkb9AU6yG_C0pS2MhnhLvA3u5NAeI4koKWj033udvnf68jA25BDFiVIwQf8o75EQICIuU6W6bLzBR3Zrg-sl2JOvbi225bsXHutTE5RNsN2H9lrVZ2qpzzpHPDc0-G-PHeazQ7YM17vFKpuuQ9RGhYYUd4gmLmKkFI9aWSwKco5iAOWIO21FkXIOCZdktSHpEtASBBlpgcseG_1uv9q89mWF_pl_1PlXLV-18zwd</recordid><startdate>20220228</startdate><enddate>20220228</enddate><creator>de Figueiredo, Celina M. H</creator><creator>de Melo, Alexsander A</creator><creator>Oliveira, Fabiano S</creator><creator>Silva, Ana</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220228</creationdate><title>MaxCut on Permutation Graphs is NP-complete</title><author>de Figueiredo, Celina M. H ; de Melo, Alexsander A ; Oliveira, Fabiano S ; Silva, Ana</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-7e51daa74b4ae9af65cabbedde4005de1d6c2b9110813ec67e3d806302e73c013</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Discrete Mathematics</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>de Figueiredo, Celina M. H</creatorcontrib><creatorcontrib>de Melo, Alexsander A</creatorcontrib><creatorcontrib>Oliveira, Fabiano S</creatorcontrib><creatorcontrib>Silva, Ana</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>de Figueiredo, Celina M. H</au><au>de Melo, Alexsander A</au><au>Oliveira, Fabiano S</au><au>Silva, Ana</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>MaxCut on Permutation Graphs is NP-complete</atitle><date>2022-02-28</date><risdate>2022</risdate><abstract>In this paper, we prove that the MaxCut problem is NP-complete on permutation
graphs, settling a long-standing open problem that appeared in the 1985 column
of the "Ongoing Guide to NP-completeness" by David S. Johnson.</abstract><doi>10.48550/arxiv.2202.13955</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2202.13955 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2202_13955 |
| source | arXiv.org |
| subjects | Computer Science - Computational Complexity Computer Science - Discrete Mathematics Mathematics - Combinatorics |
| title | MaxCut on Permutation Graphs is NP-complete |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T01%3A46%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=MaxCut%20on%20Permutation%20Graphs%20is%20NP-complete&rft.au=de%20Figueiredo,%20Celina%20M.%20H&rft.date=2022-02-28&rft_id=info:doi/10.48550/arxiv.2202.13955&rft_dat=%3Carxiv_GOX%3E2202_13955%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |