{"id":"https://openalex.org/W4252949575","doi":"https://doi.org/10.1587/transfun.2019dmp0014","title":"Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem","display_name":"Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem","publication_year":2020,"publication_date":"2020-09-30","ids":{"openalex":"https://openalex.org/W4252949575","doi":"https://doi.org/10.1587/transfun.2019dmp0014"},"language":"en","primary_location":{"id":"doi:10.1587/transfun.2019dmp0014","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transfun.2019dmp0014","pdf_url":null,"source":{"id":"https://openalex.org/S166990724","display_name":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","issn_l":"0916-8508","issn":["0916-8508","1745-1337"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cris.maastrichtuniversity.nl/en/publications/a6298ba4-3606-428a-9334-f8d45eb37304","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057410359","display_name":"Eiji Miyano","orcid":"https://orcid.org/0000-0002-4260-7818"},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Eiji MIYANO","raw_affiliation_strings":["Kyushu Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Kyushu Institute of Technology","institution_ids":["https://openalex.org/I207014233"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037768595","display_name":"Toshiki Saitoh","orcid":"https://orcid.org/0000-0003-4676-5167"},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshiki SAITOH","raw_affiliation_strings":["Kyushu Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Kyushu Institute of Technology","institution_ids":["https://openalex.org/I207014233"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054829031","display_name":"Ryuhei Uehara","orcid":"https://orcid.org/0000-0003-0895-3765"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryuhei UEHARA","raw_affiliation_strings":["Japan Advanced Institute of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Japan Advanced Institute of Science and Technology","institution_ids":["https://openalex.org/I177738480"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022727245","display_name":"Tsuyoshi YAGITA","orcid":null},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tsuyoshi YAGITA","raw_affiliation_strings":["Kyushu Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Kyushu Institute of Technology","institution_ids":["https://openalex.org/I207014233"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037940407","display_name":"Tom C. van der Zanden","orcid":"https://orcid.org/0000-0003-3080-3210"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Tom C. van der ZANDEN","raw_affiliation_strings":["Maastricht University"],"affiliations":[{"raw_affiliation_string":"Maastricht University","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5057410359"],"corresponding_institution_ids":["https://openalex.org/I207014233"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2921781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"E103.A","issue":"10","first_page":"1193","last_page":"1201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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":0.9990000128746033,"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.9955000281333923,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9081000089645386,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.844961404800415},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8067879676818848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.672823965549469},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.6460136771202087},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6186348795890808},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5602986812591553},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.504564642906189},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.49048587679862976},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4842912554740906},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.48226791620254517},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4658779799938202},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4554436504840851},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.433504581451416},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4268210530281067},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40938958525657654},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3477536141872406},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.31706541776657104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13590234518051147},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06893539428710938}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.844961404800415},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8067879676818848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.672823965549469},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.6460136771202087},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6186348795890808},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5602986812591553},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.504564642906189},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.49048587679862976},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4842912554740906},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.48226791620254517},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4658779799938202},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4554436504840851},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.433504581451416},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4268210530281067},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40938958525657654},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3477536141872406},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.31706541776657104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13590234518051147},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06893539428710938},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1587/transfun.2019dmp0014","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transfun.2019dmp0014","pdf_url":null,"source":{"id":"https://openalex.org/S166990724","display_name":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","issn_l":"0916-8508","issn":["0916-8508","1745-1337"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/a6298ba4-3606-428a-9334-f8d45eb37304","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/a6298ba4-3606-428a-9334-f8d45eb37304","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Miyano, E, Saitoh, T, Uehara, R, Yagita, T & van der Zanden, T C 2020, 'Complexity of the Maximum k-Path Vertex Cover Problem', Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. E103A, no. 10, pp. 1193-1201. https://doi.org/10.1587/transfun.2019DMP0014","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/a6298ba4-3606-428a-9334-f8d45eb37304","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/a6298ba4-3606-428a-9334-f8d45eb37304","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Miyano, E, Saitoh, T, Uehara, R, Yagita, T & van der Zanden, T C 2020, 'Complexity of the Maximum k-Path Vertex Cover Problem', Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences, vol. E103A, no. 10, pp. 1193-1201. https://doi.org/10.1587/transfun.2019DMP0014","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W9203110","https://openalex.org/W880397381","https://openalex.org/W1527664624","https://openalex.org/W1968635621","https://openalex.org/W1973264045","https://openalex.org/W1982107970","https://openalex.org/W1987064693","https://openalex.org/W2049200290","https://openalex.org/W2052790720","https://openalex.org/W2059372025","https://openalex.org/W2070576097","https://openalex.org/W2079828065","https://openalex.org/W2141925838","https://openalex.org/W2154851838","https://openalex.org/W2199703934","https://openalex.org/W2216743162","https://openalex.org/W2313886575","https://openalex.org/W2412257713","https://openalex.org/W2552909035"],"related_works":["https://openalex.org/W2025716666","https://openalex.org/W2964258819","https://openalex.org/W2947118872","https://openalex.org/W2359923140","https://openalex.org/W1966805076","https://openalex.org/W3150189735","https://openalex.org/W2037935057","https://openalex.org/W2012700732","https://openalex.org/W2034112762","https://openalex.org/W4252949575"],"abstract_inverted_index":{"This":[0],"paper":[1,104],"introduces":[2],"the":[3,7,13,69,87,107,127],"maximization":[4],"version":[5],"of":[6,25,31,71,80,89,109,113],"k-path":[8,40],"vertex":[9,44,48,77],"cover":[10],"problem,":[11],"called":[12,35],"Maximum":[14],"K-Path":[15],"Vertex":[16],"Cover":[17],"problem":[18,97],"(MaxPkVC":[19],"for":[20,122],"short):":[21],"A":[22],"path":[23,30],"consisting":[24],"k":[26],"vertices,":[27],"i.e.,":[28],"a":[29,36,39,43,47,61,76],"length":[32],"k-1":[33],"is":[34,73,94,99,130],"k-path.":[37],"If":[38],"Pk":[41],"includes":[42],"v":[45,55],"in":[46,143],"set":[49],"S,":[50],"then":[51,138],"we":[52,105],"say":[53],"that":[54,86,117],"or":[56],"S":[57,93],"covers":[58],"Pk.":[59],"Given":[60],"graph":[62,129],"G=(V,":[63],"E)":[64],"and":[65],"an":[66],"integer":[67],"s,":[68],"goal":[70],"MaxPkVC":[72,98,110],"to":[74,132],"find":[75],"subset":[78],"S\u2286V":[79],"at":[81],"most":[82],"s":[83],"vertices":[84],"such":[85],"number":[88],"k-paths":[90],"covered":[91],"by":[92],"maximized.":[95],"The":[96],"generally":[100],"NP-hard.":[101],"In":[102],"this":[103],"consider":[106],"tractability/intractability":[108],"on":[111],"subclasses":[112],"graphs.":[114,124],"We":[115],"prove":[116],"MaxP3VC":[118,139],"remains":[119],"NP-hard":[120],"even":[121],"split":[123],"Furthermore,":[125],"if":[126],"input":[128],"restricted":[131],"graphs":[133],"with":[134],"constant":[135],"bounded":[136],"treewidth,":[137],"can":[140],"be":[141],"solved":[142],"polynomial":[144],"time.":[145]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}