{"id":"https://openalex.org/W2320870395","doi":"https://doi.org/10.23638/dmtcs-21-4-17","title":"An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth","display_name":"An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth","publication_year":2019,"publication_date":"2019-11-04","ids":{"openalex":"https://openalex.org/W2320870395","doi":"https://doi.org/10.23638/dmtcs-21-4-17","mag":"2320870395"},"language":"en","primary_location":{"id":"doi:10.23638/dmtcs-21-4-17","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-4-17","pdf_url":"https://dmtcs.episciences.org/5867/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dmtcs.episciences.org/5867/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004889215","display_name":"Zongwen Bai","orcid":null},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]},{"id":"https://openalex.org/I4210102412","display_name":"Yan'an University","ror":"https://ror.org/01dyr7034","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210102412"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zongwen Bai","raw_affiliation_strings":["School of Physics and Electronic Information, Yan'an University, Yan'an, Shaanxi 716000, China","School of Computer Science, Northwestern Polytechnical University, Xi'an, Shaanxi, 710072, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Physics and Electronic Information, Yan'an University, Yan'an, Shaanxi 716000, China","institution_ids":["https://openalex.org/I4210102412"]},{"raw_affiliation_string":"School of Computer Science, Northwestern Polytechnical University, Xi'an, Shaanxi, 710072, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101728553","display_name":"Jianhua Tu","orcid":"https://orcid.org/0000-0002-7667-2116"},"institutions":[{"id":"https://openalex.org/I75390827","display_name":"Beijing University of Chemical Technology","ror":"https://ror.org/00df5yc52","country_code":"CN","type":"education","lineage":["https://openalex.org/I75390827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianhua Tu","raw_affiliation_strings":["Department of Mathematics, Beijing University of Chemical Technology, Beijing 100029, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Beijing University of Chemical Technology, Beijing 100029, China","institution_ids":["https://openalex.org/I75390827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062762366","display_name":"Yongtang Shi","orcid":"https://orcid.org/0000-0001-9406-7967"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongtang Shi","raw_affiliation_strings":["Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, China","institution_ids":["https://openalex.org/I205237279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.415,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.827793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"vol. 21 no. 4","issue":"Discrete Algorithms","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8929194211959839},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7610339522361755},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6364032030105591},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6069724559783936},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5894650816917419},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5628005266189575},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5625177621841431},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.49222245812416077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4560943841934204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4291391968727112},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4118679165840149},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4093632996082306},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.36889714002609253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3628111183643341},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.357962429523468},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3468782901763916},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0748257040977478},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.060349732637405396}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8929194211959839},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7610339522361755},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6364032030105591},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6069724559783936},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5894650816917419},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5628005266189575},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5625177621841431},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.49222245812416077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4560943841934204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4291391968727112},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4118679165840149},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4093632996082306},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.36889714002609253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3628111183643341},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.357962429523468},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3468782901763916},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0748257040977478},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.060349732637405396},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/dmtcs-21-4-17","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-4-17","pdf_url":"https://dmtcs.episciences.org/5867/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1603.09448","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.09448","pdf_url":"https://arxiv.org/pdf/1603.09448","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2320870395","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1603.09448v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:211f4ea0a3be4a46b3a39f423e7245d5","is_oa":true,"landing_page_url":"https://doaj.org/article/211f4ea0a3be4a46b3a39f423e7245d5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 4, Iss Discrete Algorithms (2019)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.23638/dmtcs-21-4-17","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-4-17","pdf_url":"https://dmtcs.episciences.org/5867/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4787223102","display_name":null,"funder_award_id":"17JCQNJC00300","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6460628717","display_name":null,"funder_award_id":"17JCQNJC00300","funder_id":"https://openalex.org/F4320323993","funder_display_name":"Natural Science Foundation of Tianjin City"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320323993","display_name":"Natural Science Foundation of Tianjin City","ror":null},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2320870395.pdf","grobid_xml":"https://content.openalex.org/works/W2320870395.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1484040084","https://openalex.org/W1493923326","https://openalex.org/W1517036688","https://openalex.org/W1579510955","https://openalex.org/W1580414818","https://openalex.org/W1804016314","https://openalex.org/W1968635621","https://openalex.org/W1987796300","https://openalex.org/W2004181701","https://openalex.org/W2034112762","https://openalex.org/W2045326192","https://openalex.org/W2050952499","https://openalex.org/W2052227003","https://openalex.org/W2052790720","https://openalex.org/W2059273723","https://openalex.org/W2059372025","https://openalex.org/W2070576097","https://openalex.org/W2116793595","https://openalex.org/W2137986027","https://openalex.org/W2199703934","https://openalex.org/W2264404578","https://openalex.org/W2340006107","https://openalex.org/W2472778302","https://openalex.org/W2914414140"],"related_works":["https://openalex.org/W1976784955","https://openalex.org/W2029854525","https://openalex.org/W2889180046","https://openalex.org/W2012687409","https://openalex.org/W1585579706","https://openalex.org/W2091382007","https://openalex.org/W2567822775","https://openalex.org/W1976463682","https://openalex.org/W2803227791","https://openalex.org/W143512583"],"abstract_inverted_index":{"Given":[0],"a":[1,5,21,64,127],"graph":[2],"$G=(V,E)$":[3],"and":[4,53,92],"positive":[6],"integer":[7,51],"$t\\geq2$,":[8],"the":[9,12,61,74,94,107,111,122,135],"task":[10],"in":[11,35,57,69],"vertex":[13,41,101],"cover":[14,102],"$P_t$":[15],"($VCP_t$)":[16],"problem":[17,46,76,105,113,137],"is":[18,47,106,116],"to":[19,96,118],"find":[20],"minimum":[22],"subset":[23],"of":[24,32,90,110],"vertices":[25],"$F\\subseteq":[26],"V$":[27],"such":[28],"that":[29],"every":[30],"path":[31],"order":[33],"$t$":[34],"$G$":[36],"contains":[37],"at":[38],"least":[39],"one":[40],"from":[42],"$F$.":[43],"The":[44,99],"$VCP_t$":[45],"NP-complete":[48],"for":[49,73,134],"any":[50],"$t\\geq2$":[52],"has":[54],"many":[55],"applications":[56],"real":[58],"world.":[59],"Recently,":[60],"authors":[62,154],"presented":[63],"dynamic":[65],"programming":[66],"algorithm":[67,129],"running":[68],"time":[70],"$4^p\\cdot":[71,132],"n^{O(1)}$":[72,133],"$VCP_3$":[75,112],"on":[77,138],"$n$-vertex":[78,139],"graphs":[79,140],"with":[80,130,141,150],"treewidth":[81,142],"$p$.":[82,143],"In":[83],"this":[84],"paper,":[85],"we":[86,125],"propose":[87],"an":[88],"improvement":[89],"it":[91],"improved":[93],"time-complexity":[95],"$3^p\\cdot":[97],"n^{O(1)}$.":[98],"connected":[100,108],"$P_3$":[103],"($CVCP_3$)":[104],"variation":[109],"where":[114],"$G[F]$":[115],"required":[117],"be":[119],"connected.":[120],"Using":[121],"Cut\\&Count":[123],"technique,":[124],"give":[126],"randomized":[128],"runtime":[131],"$CVCP_3$":[136],"Comment:":[144],"arXiv":[145],"admin":[146],"note:":[147],"text":[148],"overlap":[149],"arXiv:1103.0534":[151],"by":[152],"other":[153]},"counts_by_year":[{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-10-10T00:00:00"}