An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$. The $VCP_t$ problem is NP-complete for any integer $t\g...
Uloženo v:
| Vydáno v: | Discrete mathematics and theoretical computer science Ročník 21 no. 4; číslo Discrete Algorithms |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
04.11.2019
|
| Témata: | |
| ISSN: | 1365-8050, 1365-8050 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$. The $VCP_t$ problem is NP-complete for any integer $t\geq2$ and has many applications in real world. Recently, the authors presented a dynamic programming algorithm running in time $4^p\cdot n^{O(1)}$ for the $VCP_3$ problem on $n$-vertex graphs with treewidth $p$. In this paper, we propose an improvement of it and improved the time-complexity to $3^p\cdot n^{O(1)}$. The connected vertex cover $P_3$ ($CVCP_3$) problem is the connected variation of the $VCP_3$ problem where $G[F]$ is required to be connected. Using the Cut\&Count technique, we give a randomized algorithm with runtime $4^p\cdot n^{O(1)}$ for the $CVCP_3$ problem on $n$-vertex graphs with treewidth $p$.
Comment: arXiv admin note: text overlap with arXiv:1103.0534 by other authors |
|---|---|
| AbstractList | Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$. The $VCP_t$ problem is NP-complete for any integer $t\geq2$ and has many applications in real world. Recently, the authors presented a dynamic programming algorithm running in time $4^p\cdot n^{O(1)}$ for the $VCP_3$ problem on $n$-vertex graphs with treewidth $p$. In this paper, we propose an improvement of it and improved the time-complexity to $3^p\cdot n^{O(1)}$. The connected vertex cover $P_3$ ($CVCP_3$) problem is the connected variation of the $VCP_3$ problem where $G[F]$ is required to be connected. Using the Cut\&Count technique, we give a randomized algorithm with runtime $4^p\cdot n^{O(1)}$ for the $CVCP_3$ problem on $n$-vertex graphs with treewidth $p$.
Comment: arXiv admin note: text overlap with arXiv:1103.0534 by other authors Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$. The $VCP_t$ problem is NP-complete for any integer $t\geq2$ and has many applications in real world. Recently, the authors presented a dynamic programming algorithm running in time $4^p\cdot n^{O(1)}$ for the $VCP_3$ problem on $n$-vertex graphs with treewidth $p$. In this paper, we propose an improvement of it and improved the time-complexity to $3^p\cdot n^{O(1)}$. The connected vertex cover $P_3$ ($CVCP_3$) problem is the connected variation of the $VCP_3$ problem where $G[F]$ is required to be connected. Using the Cut\&Count technique, we give a randomized algorithm with runtime $4^p\cdot n^{O(1)}$ for the $CVCP_3$ problem on $n$-vertex graphs with treewidth $p$. |
| Author | Bai, Zongwen Shi, Yongtang Tu, Jianhua |
| Author_xml | – sequence: 1 givenname: Zongwen surname: Bai fullname: Bai, Zongwen – sequence: 2 givenname: Jianhua surname: Tu fullname: Tu, Jianhua – sequence: 3 givenname: Yongtang surname: Shi fullname: Shi, Yongtang |
| BookMark | eNpN0D1PwzAQBmALFYm2sDJ76JrizzgZq_JVqQgkihgtxz43qZK4ckKBf0_UIsR0p3tfPcNN0KgNLSB0Tcmc8ZRnN7dPm-VrwmgiEqrO0JjyVCYZkWT0b79Ak67bEUJZLtQYvS9aXDX7GA7gsKm3IVZ92WAfIu5LwAeIPXxhO8QRz140n-GhW9TQ4NDibTT7ssPB4yJ8tG4Q-gjwWbm-vETn3tQdXP3OKXq7v9ssH5P188NquVgnlgqpEk8KmhmjjHU0806xNGMpsVw4Bp45Y3PmpcqGnEg7dIQqOCcyS9PcMADGp2h1cl0wO72PVWPitw6m0sdDiFttYl_ZGjSj1AswxPAChBFpwQ3PvWAcFBPSycGanywbQ9dF8H8eJfr4Yn188SBpoaniP6G-cI4 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.23638/DMTCS-21-4-17 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1365-8050 |
| ExternalDocumentID | oai_doaj_org_article_211f4ea0a3be4a46b3a39f423e7245d5 10_23638_DMTCS_21_4_17 |
| GroupedDBID | -~9 .4S .DC 29G 2WC 5GY 5VS 8FE 8FG AAFWJ AAYXX ABDBF ABJCF ABUWG ACGFO ACIWK ACUHS ADBBV ADQAK AENEX AFFHD AFKRA AFPKN AIAGR ALMA_UNASSIGNED_HOLDINGS AMVHM ARCSS B0M BAIFH BBTPI BCNDV BENPR BFMQW BGLVJ BPHCQ CCPQU CITATION EAP EBS ECS EDO EJD EMK EPL EST ESX GROUPED_DOAJ HCIFZ I-F IAO IBB ICD ITC J9A KQ8 KWQ L6V M7S MK~ ML~ OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PV9 REM RNS RSU RZL TR2 TUS XSB ~8M |
| ID | FETCH-LOGICAL-c1457-f0b18aa7acd18fd7268260c34d2ef2dac92f5787ac05ccd147b33058669a2ee23 |
| IEDL.DBID | DOA |
| ISSN | 1365-8050 |
| IngestDate | Tue Oct 14 14:31:04 EDT 2025 Sat Nov 29 08:06:17 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Discrete Algorithms |
| Language | English |
| License | https://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1457-f0b18aa7acd18fd7268260c34d2ef2dac92f5787ac05ccd147b33058669a2ee23 |
| OpenAccessLink | https://doaj.org/article/211f4ea0a3be4a46b3a39f423e7245d5 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_211f4ea0a3be4a46b3a39f423e7245d5 crossref_primary_10_23638_DMTCS_21_4_17 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-11-04 |
| PublicationDateYYYYMMDD | 2019-11-04 |
| PublicationDate_xml | – month: 11 year: 2019 text: 2019-11-04 day: 04 |
| PublicationDecade | 2010 |
| PublicationTitle | Discrete mathematics and theoretical computer science |
| PublicationYear | 2019 |
| Publisher | Discrete Mathematics & Theoretical Computer Science |
| Publisher_xml | – name: Discrete Mathematics & Theoretical Computer Science |
| SSID | ssj0012947 |
| Score | 2.127373 |
| Snippet | Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | computer science - data structures and algorithms mathematics - combinatorics |
| Title | An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth |
| URI | https://doaj.org/article/211f4ea0a3be4a46b3a39f423e7245d5 |
| Volume | 21 no. 4 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: DOA dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVPQU databaseName: AUTh Library subscriptions: ProQuest Central customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BENPR dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Continental Europe Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BFMQW dateStart: 19970101 isFulltext: true titleUrlDefault: https://search.proquest.com/conteurope providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: M7S dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: PIMPY dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07b9swECYKp0MyJG2aoHk04GAgE2GJPInSmEeDdnBgoA6aTgSfsYFUDmLn8fNzpGTXW5eswoEQvuPh7hOp7yOkjz029sWSOSMKBqasmPamYsJnYGueax90MpuQ19fV7W09WrP6infCWnngFrgBEpQAXmdaGA8aSiO0qAMOAV5yKFxSL81kvSRT3fkBr0G2Eo1c4A4bXA7HF78YR7rEkjXZvxa0ptSfWsrVJ7LdzYL0rH2Hz-SDb3bJztJngXZlt0u2hitt1fkX8vusodP0KcA7qu_vZkjvJ38pDp8Uo2j0V_av1MarmbQ_UqJPO9MYOmto0qee01mgJvop4QrxVPpl6haTPXJz9X188YN19gjM5lBIFjKTV1pLbV1eBYeAI1XIrADHfeBOI9Qh1qO2WWExBqQRWN1VWdaae8_FPuk1s8Z_JVSaojYAMuTcQVXoyobMlh4MrmagFAfkdImYemhVMBSyh4StStgqnitQuTwg5xHQVVRUr04PMKeqy6n6X04P32ORI7KJw02d_huEY9JbPD75b-SjfV5M548nabuckI3Rz-Hozxu_98Zm |
| linkProvider | Directory of Open Access Journals |
| 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=An+improved+algorithm+for+the+vertex+cover+%24P_3%24+problem+on+graphs+of+bounded+treewidth&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Bai%2C+Zongwen&rft.au=Tu%2C+Jianhua&rft.au=Shi%2C+Yongtang&rft.date=2019-11-04&rft.issn=1365-8050&rft.eissn=1365-8050&rft.volume=21+no.+4&rft.issue=Discrete+Algorithms&rft_id=info:doi/10.23638%2FDMTCS-21-4-17&rft.externalDBID=n%2Fa&rft.externalDocID=10_23638_DMTCS_21_4_17 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon |