{"id":"https://openalex.org/W7131374697","doi":"https://doi.org/10.48550/arxiv.2602.18774","title":"Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs","display_name":"Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs","publication_year":2026,"publication_date":"2026-02-21","ids":{"openalex":"https://openalex.org/W7131374697","doi":"https://doi.org/10.48550/arxiv.2602.18774"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.18774","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18774","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.18774","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029433177","display_name":"Jakub Ruszil","orcid":"https://orcid.org/0000-0002-0659-2575"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ruszil, Jakub","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029184785","display_name":"Artur Pola\u0144ski","orcid":"https://orcid.org/0000-0002-3302-2551"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pola\u0144ski, Artur","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075995814","display_name":"Adam Roman","orcid":"https://orcid.org/0000-0003-0966-5992"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roman, Adam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113288970","display_name":"Jakub Zelek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zelek, Jakub","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029433177"],"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9517999887466431,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9517999887466431,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.016499999910593033,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.0031999999191612005,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/vertex","display_name":"Vertex (graph theory)","score":0.6065999865531921},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.536899983882904},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5019000172615051},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.49160000681877136},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4860000014305115},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4731000065803528},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4471000134944916},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.42340001463890076},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4117000102996826}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6065999865531921},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.536899983882904},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5019000172615051},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.49160000681877136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48820000886917114},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4860000014305115},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4731000065803528},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4471000134944916},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.42340001463890076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4180999994277954},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4117000102996826},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.40779998898506165},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4072999954223633},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.40619999170303345},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.374099999666214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37310001254081726},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3407000005245209},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30799999833106995},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.30169999599456787},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2833999991416931},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26820001006126404},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C2777267654","wikidata":"https://www.wikidata.org/wiki/Q3519023","display_name":"Test (biology)","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.18774","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18774","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.18774","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18774","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.746884822845459,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"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,47,63,218,228],"article":[1],"studies":[2],"edge":[3,39,61,168,184,196],"coverage":[4,19,40,169,197],"for":[5,20,202,233,240],"control":[6],"flow":[7],"graphs":[8],"extended":[9],"with":[10,98,199,267],"explicit":[11],"constraints.":[12,69,176,244,273],"Achieving":[13],"a":[14,21,25,79,99,126,142,163,172],"given":[15,22,80,127,173],"level":[16],"of":[17,60,68,102,161,175,182,226,251,272],"white-box":[18],"code":[23],"is":[24,188,216,259],"classic":[26],"problem":[27,215,258],"in":[28,113,190],"software":[29],"testing.":[30],"We":[31,156],"focus":[32],"on":[33,135,221],"designing":[34],"test":[35,76,89,96,117,123,144,164,186],"sets":[36],"that":[37,166],"achieve":[38],"\\textit{while":[41],"respecting":[42],"additional":[43,200],"constraints}":[44],"between":[45],"vertices.":[46],"paper":[48,64,262],"analyzes":[49],"how":[50],"such":[51,88,111,146],"constraints":[52,71,85,92,109,120],"affect":[53],"both":[54],"the":[55,136,158,180,213,248,252,256,261,270],"feasibility":[56],"and":[57,170,210],"computational":[58,159],"complexity":[59,160],"coverage.":[62],"discusses":[65],"five":[66],"types":[67],"POSITIVE":[70,178],"require":[72,93,121],"at":[73,114],"least":[74],"one":[75,95,103,116],"path":[77,97,124],"where":[78],"vertex":[81,104,128,133],"precedes":[82],"another.":[83,106],"NEGATIVE":[84,253],"forbid":[86],"any":[87],"path.":[90,118,138],"ONCE":[91,108],"exactly":[94],"single":[100],"occurrence":[101],"before":[105],"MAX":[107,207],"allow":[110],"precedence":[112],"most":[115],"ALWAYS":[119,211],"every":[122],"containing":[125],"to":[129,269],"also":[130],"contain":[131],"another":[132],"later":[134],"same":[137],"Each":[139],"type":[140],"models":[141],"different":[143],"requirement,":[145],"as":[147],"mandatory":[148],"flows,":[149],"semantic":[150],"exclusions,":[151],"or":[152],"execution":[153],"cost":[154],"limits.":[155],"investigate":[157],"finding":[162],"set":[165,174,187],"achieves":[167],"respects":[171],"For":[177,205],"constraints,":[179,212],"existence":[181],"an":[183,264],"covering":[185],"decidable":[189],"polynomial":[191,222],"time":[192],"by":[193],"extending":[194],"standard":[195],"constructions":[198],"paths":[201],"each":[203],"constraint.":[204,254],"NEGATIVE,":[206],"ONCE,":[208,209],"decision":[214],"NP-complete.":[217],"proofs":[219],"rely":[220],"reductions":[223],"from":[224],"variants":[225],"SAT.":[227],"NP-completeness":[229],"results":[230],"hold":[231],"even":[232],"restricted":[234],"graph":[235],"classes,":[236],"including":[237],"acyclic":[238],"graphs,":[239],"all":[241],"these":[242],"four":[243],"Finally,":[245],"we":[246],"study":[247],"fixed-parameter":[249],"tractability":[250],"Although":[255],"general":[257],"NP-complete,":[260],"presents":[263],"FPT":[265],"algorithm":[266],"respect":[268],"number":[271]},"counts_by_year":[],"updated_date":"2026-04-29T09:16:38.111599","created_date":"2026-02-26T00:00:00"}