Obtaining split graphs by edge contraction
We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges. We show that Split Contraction can be solved in FPT time 2O(k2)n5, but admits no po...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science Jg. 607; S. 60 - 67 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
23.11.2015
|
| Schlagworte: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges. We show that Split Contraction can be solved in FPT time 2O(k2)n5, but admits no polynomial kernel unless NP⊆coNP/poly. |
|---|---|
| AbstractList | We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges. We show that Split Contraction can be solved in FPT time , but admits no polynomial kernel unless . We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges. We show that Split Contraction can be solved in FPT time 2O(k2)n5, but admits no polynomial kernel unless NP⊆coNP/poly. |
| Author | Cai, Leizhen Guo, Chengwei |
| Author_xml | – sequence: 1 givenname: Chengwei surname: Guo fullname: Guo, Chengwei email: cwguo9@gmail.com – sequence: 2 givenname: Leizhen surname: Cai fullname: Cai, Leizhen email: lcai@cse.cuhk.edu.hk |
| BookMark | eNp9kD1rwzAQhkVJoUnaH9DNYynY1YdtyXQqoV8QyNLOQpbOqYIju5JSyL-vTDp1yC0Hxz3Hvc8CzdzgAKFbgguCSf2wK6IOBcWkKjApcFVfoDkRvMkpbcoZmmOGy5w1vLpCixB2OFXF6zm637RRWWfdNgtjb2O29Wr8Cll7zMBsIdODi17paAd3jS471Qe4-etL9Pny_LF6y9eb1_fV0zrXjOGYUy00cKE7IAQEgxJoxTVuqWGCdRVjSpUmjWvB0n-mxJooYVijsKG0VS1borvT3dEP3wcIUe5t0ND3ysFwCJJwUZMK17xOq-S0qv0QgodOjt7ulT9KguXkRe5k8iInLxITmbwkhv9jtI1qCpiC2v4s-XgiIaX_seBl0BacBmM96CjNYM_Qv5Xkfoc |
| CitedBy_id | crossref_primary_10_1016_j_cosrev_2022_100490 crossref_primary_10_1016_j_cosrev_2023_100556 crossref_primary_10_1145_3470869 crossref_primary_10_1016_j_tcs_2017_09_023 crossref_primary_10_1016_j_ipl_2019_05_003 crossref_primary_10_1145_3319909 |
| Cites_doi | 10.1016/0020-0190(96)00050-6 10.1016/j.tcs.2013.02.030 10.1016/j.jcss.2009.04.001 10.1016/j.jcss.2011.04.001 10.1016/j.tcs.2012.12.041 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2015.01.056 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 67 |
| ExternalDocumentID | 10_1016_j_tcs_2015_01_056 S0304397515001693 |
| GrantInformation_xml | – fundername: Research Grants Council, University Grants Committee, Hong Kong grantid: CUHK410409 funderid: http://dx.doi.org/10.13039/501100002920 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-2c8ce78cfe11e83e4e257c0b2d383f533aa4d3e4683879d40c1a8d39a0d22bab3 |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366773400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sun Nov 09 12:42:41 EST 2025 Sat Nov 29 05:15:19 EST 2025 Tue Nov 18 20:12:44 EST 2025 Fri Feb 23 02:30:25 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Split graphs FPT algorithm Edge contraction Incompressibility Parameterized complexity |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-2c8ce78cfe11e83e4e257c0b2d383f533aa4d3e4683879d40c1a8d39a0d22bab3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2015.01.056 |
| PQID | 1786150676 |
| PQPubID | 23500 |
| PageCount | 8 |
| ParticipantIDs | proquest_miscellaneous_1786150676 crossref_primary_10_1016_j_tcs_2015_01_056 crossref_citationtrail_10_1016_j_tcs_2015_01_056 elsevier_sciencedirect_doi_10_1016_j_tcs_2015_01_056 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-11-23 |
| PublicationDateYYYYMMDD | 2015-11-23 |
| PublicationDate_xml | – month: 11 year: 2015 text: 2015-11-23 day: 23 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Golovach, Kamiński, Paulusma, Thilikos (br0100) 2013; 481 Guillemot, Marx (br0120) 2013; vol. 8246 Cai (br0030) 1996; 58 Heggernes, van't Hof, Lokshtanov, Paul (br0150) 2011; vol. 13 Lokshtanov, Misra, Saurabh (br0170) 2013; vol. 8246 Heggernes, van't Hof, Lévêque, Lokshtanov, Paul (br0140) 2011; vol. 7112 Cao, Marx (br0050) 2014 Dom, Lokshtanov, Saurabh (br0080) 2009; vol. 5555 Chen, Meng (br0060) 2012; 78 Ghosh, Kolay, Kumar, Misra, Panolan, Rai, Ramanujan (br0090) 2012; vol. 7357 Lin, Kearney, Jiang (br0160) 2000; vol. 1969 Cygan, Pilipczuk (br0070) 2012 Golovach, van't Hof, Paulusma (br0110) 2013; 476 Cai, Guo (br0040) 2013; vol. 8246 Belmonte, Golovach, van't Hof, Paulusma (br0010) 2013; vol. 8246 Guo (br0130) 2007; vol. 4835 Bodlaender, Downey, Fellows, Hermelin (br0020) 2009; 75 Lin (10.1016/j.tcs.2015.01.056_br0160) 2000; vol. 1969 Lokshtanov (10.1016/j.tcs.2015.01.056_br0170) 2013; vol. 8246 Golovach (10.1016/j.tcs.2015.01.056_br0110) 2013; 476 Cai (10.1016/j.tcs.2015.01.056_br0030) 1996; 58 Golovach (10.1016/j.tcs.2015.01.056_br0100) 2013; 481 Cygan (10.1016/j.tcs.2015.01.056_br0070) Chen (10.1016/j.tcs.2015.01.056_br0060) 2012; 78 Heggernes (10.1016/j.tcs.2015.01.056_br0140) 2011; vol. 7112 Dom (10.1016/j.tcs.2015.01.056_br0080) 2009; vol. 5555 Bodlaender (10.1016/j.tcs.2015.01.056_br0020) 2009; 75 Ghosh (10.1016/j.tcs.2015.01.056_br0090) 2012; vol. 7357 Cao (10.1016/j.tcs.2015.01.056_br0050) 2014 Heggernes (10.1016/j.tcs.2015.01.056_br0150) 2011; vol. 13 Cai (10.1016/j.tcs.2015.01.056_br0040) 2013; vol. 8246 Belmonte (10.1016/j.tcs.2015.01.056_br0010) 2013; vol. 8246 Guillemot (10.1016/j.tcs.2015.01.056_br0120) 2013; vol. 8246 Guo (10.1016/j.tcs.2015.01.056_br0130) 2007; vol. 4835 |
| References_xml | – start-page: 122 year: 2014 end-page: 141 ident: br0050 article-title: Interval deletion is fixed-parameter tractable publication-title: SODA 2014 – volume: vol. 8246 start-page: 16 year: 2013 end-page: 27 ident: br0010 article-title: Parameterized complexity of two edge contraction problems with degree constraints publication-title: IPEC 2013 – volume: vol. 8246 start-page: 97 year: 2013 end-page: 109 ident: br0040 article-title: Contracting few edges to remove forbidden induced subgraphs publication-title: IPEC 2013 – year: 2012 ident: br0070 article-title: On fixed-parameter algorithms for split vertex deletion – volume: vol. 8246 start-page: 177 year: 2013 end-page: 188 ident: br0120 article-title: A faster FPT algorithm for bipartite contraction publication-title: IPEC 2013 – volume: 75 start-page: 423 year: 2009 end-page: 434 ident: br0020 article-title: On problems without polynomial kernels publication-title: J. Comput. System Sci. – volume: vol. 7357 start-page: 107 year: 2012 end-page: 118 ident: br0090 article-title: Faster parameterized algorithms for deletion to split graphs publication-title: SWAT 2012 – volume: 58 start-page: 171 year: 1996 end-page: 176 ident: br0030 article-title: Fixed-parameter tractability of graph modification problems for hereditary properties publication-title: Inform. Process. Lett. – volume: vol. 13 start-page: 217 year: 2011 end-page: 228 ident: br0150 article-title: Obtaining a bipartite graph by contracting few edges publication-title: FSTTCS 2011 – volume: vol. 4835 start-page: 915 year: 2007 end-page: 926 ident: br0130 article-title: Problem kernels for NP-complete edge deletion problems: split and related graphs publication-title: ISAAC 2007 – volume: 476 start-page: 38 year: 2013 end-page: 46 ident: br0110 article-title: Obtaining planarity by contracting few edges publication-title: Theoret. Comput. Sci. – volume: vol. 7112 start-page: 55 year: 2011 end-page: 66 ident: br0140 article-title: Contracting graphs to paths and trees publication-title: IPEC 2011 – volume: vol. 1969 start-page: 539 year: 2000 end-page: 551 ident: br0160 article-title: Phylogenetic publication-title: ISAAC 2000 – volume: vol. 8246 start-page: 243 year: 2013 end-page: 254 ident: br0170 article-title: On the hardness of eliminating small induced subgraphs by contracting edges publication-title: IPEC 2013 – volume: 78 start-page: 211 year: 2012 end-page: 220 ident: br0060 article-title: A 2k kernel for the cluster editing problem publication-title: J. Comput. System Sci. – volume: 481 start-page: 74 year: 2013 end-page: 84 ident: br0100 article-title: Increasing the minimum degree of a graph by contractions publication-title: Theoret. Comput. Sci. – volume: vol. 5555 start-page: 378 year: 2009 end-page: 389 ident: br0080 article-title: Incompressibility through colors and IDs publication-title: ICALP 2009 – volume: vol. 8246 start-page: 177 year: 2013 ident: 10.1016/j.tcs.2015.01.056_br0120 article-title: A faster FPT algorithm for bipartite contraction – volume: vol. 8246 start-page: 97 year: 2013 ident: 10.1016/j.tcs.2015.01.056_br0040 article-title: Contracting few edges to remove forbidden induced subgraphs – volume: 58 start-page: 171 year: 1996 ident: 10.1016/j.tcs.2015.01.056_br0030 article-title: Fixed-parameter tractability of graph modification problems for hereditary properties publication-title: Inform. Process. Lett. doi: 10.1016/0020-0190(96)00050-6 – ident: 10.1016/j.tcs.2015.01.056_br0070 – volume: vol. 4835 start-page: 915 year: 2007 ident: 10.1016/j.tcs.2015.01.056_br0130 article-title: Problem kernels for NP-complete edge deletion problems: split and related graphs – volume: vol. 8246 start-page: 16 year: 2013 ident: 10.1016/j.tcs.2015.01.056_br0010 article-title: Parameterized complexity of two edge contraction problems with degree constraints – volume: vol. 5555 start-page: 378 year: 2009 ident: 10.1016/j.tcs.2015.01.056_br0080 article-title: Incompressibility through colors and IDs – volume: 481 start-page: 74 year: 2013 ident: 10.1016/j.tcs.2015.01.056_br0100 article-title: Increasing the minimum degree of a graph by contractions publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2013.02.030 – volume: vol. 1969 start-page: 539 year: 2000 ident: 10.1016/j.tcs.2015.01.056_br0160 article-title: Phylogenetic k-root and steiner k-root – start-page: 122 year: 2014 ident: 10.1016/j.tcs.2015.01.056_br0050 article-title: Interval deletion is fixed-parameter tractable – volume: vol. 7112 start-page: 55 year: 2011 ident: 10.1016/j.tcs.2015.01.056_br0140 article-title: Contracting graphs to paths and trees – volume: 75 start-page: 423 issue: 8 year: 2009 ident: 10.1016/j.tcs.2015.01.056_br0020 article-title: On problems without polynomial kernels publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2009.04.001 – volume: 78 start-page: 211 issue: 1 year: 2012 ident: 10.1016/j.tcs.2015.01.056_br0060 article-title: A 2k kernel for the cluster editing problem publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2011.04.001 – volume: vol. 13 start-page: 217 year: 2011 ident: 10.1016/j.tcs.2015.01.056_br0150 article-title: Obtaining a bipartite graph by contracting few edges – volume: vol. 8246 start-page: 243 year: 2013 ident: 10.1016/j.tcs.2015.01.056_br0170 article-title: On the hardness of eliminating small induced subgraphs by contracting edges – volume: 476 start-page: 38 year: 2013 ident: 10.1016/j.tcs.2015.01.056_br0110 article-title: Obtaining planarity by contracting few edges publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2012.12.041 – volume: vol. 7357 start-page: 107 year: 2012 ident: 10.1016/j.tcs.2015.01.056_br0090 article-title: Faster parameterized algorithms for deletion to split graphs |
| SSID | ssj0000576 |
| Score | 2.200625 |
| Snippet | We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 60 |
| SubjectTerms | Complexity Contraction Edge contraction FPT algorithm Graph theory Graphs Incompressibility Integers Kernels Parameterized complexity Polynomials Split graphs |
| Title | Obtaining split graphs by edge contraction |
| URI | https://dx.doi.org/10.1016/j.tcs.2015.01.056 https://www.proquest.com/docview/1786150676 |
| Volume | 607 |
| WOSCitedRecordID | wos000366773400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELag4wEe-DFAjF8KEk-rMiWxE9uPExoCBAOJIvXNcpzL1gll05LC4K_nnHPSqhMTIPESVVaSWve55693vvsYe6mkywFphVcNkLHg1salAB6LIqnTzKuclH13_ffy8FDN5_pTkJJrezkB2TTq4kKf_VeocQzB9qWzfwH3-FIcwM8IOl4Rdrz-EfAfy45UH6YtEsxu2rekbj3N9KEzOptO1QzrxHS2VtDogtLDNGyP4xmdJcVVj6E5-g6LVfqCKqxh8fM4FJaFMEKa-3o6qvSl2Nal-haqqfJ5E03aJntALlJJHWcZSRMPPrQg6drgBUkhIOynpLZxyVNT0OBkr3O-aXpKzVPzja7Y_T772c_CTwK5a9875jrbymSu1YRt7b89mL9b7by5pNx0mPWQxe7P82180e94yMaO3NOM2V12O_w_iPYJ13vsGjTb7M6gvREFV7zNbn0Y--2299nuCHrUgx4R6FH5I_KgR2ugP2BfXh_MXr2JgwpG7DhPujhzyoFUroY0BcVBAHpZl5RZxRWvka1bKyocLhRHZCqRuNSqimubVFlW2pI_ZJPmtIFHLFLCSm3TGu8B4WReKltLQJIHDrSo9A5LBpsYF1rEe6WSr2Y4C3hi0IzGm9EkqUEz7rDd8ZEz6o9y1c1iMLQJK5iIm8FVcdVjLwZQDDo_n9GyDZwuW5NK5QUNClk8_rdXP2E3Vz-Gp2zSnS_hGbvhvnWL9vx5WF-_ADg5fVs |
| linkProvider | Elsevier |
| 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=Obtaining+split+graphs+by+edge+contraction&rft.jtitle=Theoretical+computer+science&rft.au=Guo%2C+Chengwei&rft.au=Cai%2C+Leizhen&rft.date=2015-11-23&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=607&rft.spage=60&rft.epage=67&rft_id=info:doi/10.1016%2Fj.tcs.2015.01.056&rft.externalDocID=S0304397515001693 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |