{"id":"https://openalex.org/W4414692522","doi":"https://doi.org/10.48550/arxiv.2507.09377","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","display_name":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","publication_year":2025,"publication_date":"2025-07-12","ids":{"openalex":"https://openalex.org/W4414692522","doi":"https://doi.org/10.48550/arxiv.2507.09377"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2507.09377","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.09377","pdf_url":"https://arxiv.org/pdf/2507.09377","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.09377","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119792163","display_name":"Mumuksh Tayal","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tayal, Mumuksh","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5119792163"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9279000163078308,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.9351999759674072},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8172000050544739},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5942999720573425},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5827000141143799},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.553600013256073},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5289000272750854},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49129998683929443},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.46889999508857727}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9351999759674072},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8172000050544739},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5942999720573425},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5827000141143799},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.553600013256073},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5289000272750854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5152999758720398},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49129998683929443},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.46889999508857727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42649999260902405},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4122999906539917},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3767000138759613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3682999908924103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3677999973297119},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32749998569488525},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.32199999690055847},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.3034000098705292},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.28630000352859497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.273499995470047},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2507.09377","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.09377","pdf_url":"https://arxiv.org/pdf/2507.09377","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"doi:10.48550/arxiv.2507.09377","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.09377","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2507.09377","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.09377","pdf_url":"https://arxiv.org/pdf/2507.09377","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,72,112],"Minimum":[1,59],"Vertex":[2,60],"Cover":[3,61],"problem,":[4,8],"a":[5,22,31,75,88],"classical":[6],"NP-complete":[7],"presents":[9,47],"significant":[10,120],"challenges":[11],"for":[12,57,123],"exact":[13],"solution":[14],"on":[15,79,87],"large":[16,126],"graphs.":[17],"Fixed-Parameter":[18],"Tractability":[19],"(FPT)":[20],"offers":[21],"powerful":[23],"paradigm":[24],"to":[25,38],"address":[26],"such":[27],"problems":[28],"by":[29,64],"exploiting":[30],"parameter":[32,137],"of":[33,41,53,67,128,135],"the":[34,39,42,58,65,68,93,108,116,136,154,159],"input,":[35],"typically":[36],"related":[37],"size":[40,66],"desired":[43],"solution.":[44],"This":[45],"paper":[46],"an":[48,54],"implementation":[49,96,118],"and":[50,83,100],"empirical":[51],"evaluation":[52],"FPT":[55,117,142],"algorithm":[56,73],"problem":[62],"parameterized":[63],"vertex":[69],"cover,":[70],"$k$.":[71],"utilizes":[74],"branching":[76,160],"strategy":[77],"based":[78],"selecting":[80],"adjacent":[81],"vertices":[82,129],"recursively":[84],"solving":[85],"subproblems":[86],"reduced":[89],"graph.":[90],"We":[91,145],"describe":[92],"algorithmic":[94],"approach,":[95],"details":[97],"in":[98],"Python,":[99],"present":[101],"experimental":[102],"results":[103,113],"comparing":[104],"its":[105],"performance":[106,121],"against":[107],"SageMath":[109],"computational":[110],"system.":[111],"demonstrate":[114],"that":[115,150],"achieves":[119],"improvements":[122],"instances":[124],"with":[125,140],"numbers":[127],"($n$)":[130],"but":[131],"relatively":[132],"small":[133],"values":[134],"($k$),":[138],"aligning":[139],"theoretical":[141],"complexity":[143],"guarantees.":[144],"also":[146],"discuss":[147],"potential":[148],"optimizations":[149],"could":[151],"further":[152],"improve":[153],"algorithm's":[155],"performance,":[156],"particularly":[157],"concerning":[158],"factor.":[161]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}