{"id":"https://openalex.org/W7143787441","doi":"https://doi.org/10.1016/j.jcss.2026.103802","title":"Exact and heuristic computation of the scanwidth of directed acyclic graphs","display_name":"Exact and heuristic computation of the scanwidth of directed acyclic graphs","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7143787441","doi":"https://doi.org/10.1016/j.jcss.2026.103802"},"language":"en","primary_location":{"id":"doi:10.1016/j.jcss.2026.103802","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2026.103802","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.jcss.2026.103802","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Niels Holtgrefe","orcid":"https://orcid.org/0009-0001-6162-9668"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Niels Holtgrefe","raw_affiliation_strings":["Delft Institute of Applied Mathematics, Delft University of Technology, Delft, the Netherlands"],"raw_orcid":"https://orcid.org/0009-0001-6162-9668","affiliations":[{"raw_affiliation_string":"Delft Institute of Applied Mathematics, Delft University of Technology, Delft, the Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Leo van Iersel","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Leo van Iersel","raw_affiliation_strings":["Delft Institute of Applied Mathematics, Delft University of Technology, Delft, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft Institute of Applied Mathematics, Delft University of Technology, Delft, the Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mark Jones","orcid":null},"institutions":[{"id":"https://openalex.org/I60488453","display_name":"Middlesex University","ror":"https://ror.org/01rv4p989","country_code":"GB","type":"education","lineage":["https://openalex.org/I60488453"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Jones","raw_affiliation_strings":["Department of Computer Science, Middlesex University, London, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Middlesex University, London, United Kingdom","institution_ids":["https://openalex.org/I60488453"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":{"value":2520,"currency":"USD","value_usd":2520},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.75140953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"160","issue":null,"first_page":"103802","last_page":"103802"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5379999876022339,"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.5379999876022339,"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/T11476","display_name":"Graph theory and applications","score":0.05260000005364418,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.052299998700618744,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7741000056266785},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5236999988555908},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5073999762535095},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4661000072956085},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.32019999623298645},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.30090001225471497},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.29440000653266907}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7741000056266785},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5236999988555908},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5073999762535095},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48840001225471497},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4661000072956085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4618000090122223},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4523000121116638},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44119998812675476},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31610000133514404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31529998779296875},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30090001225471497},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.29440000653266907},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.27619999647140503},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.27410000562667847},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.2529999911785126}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.jcss.2026.103802","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2026.103802","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.jcss.2026.103802","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2026.103802","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W256842657","https://openalex.org/W1489360240","https://openalex.org/W1969186119","https://openalex.org/W1969259020","https://openalex.org/W1983383464","https://openalex.org/W2002055996","https://openalex.org/W2012473793","https://openalex.org/W2015482664","https://openalex.org/W2052210031","https://openalex.org/W2059372025","https://openalex.org/W2079966248","https://openalex.org/W2101991559","https://openalex.org/W2143693959","https://openalex.org/W2148274789","https://openalex.org/W2344026690","https://openalex.org/W2477674116","https://openalex.org/W2517904087","https://openalex.org/W2952712909","https://openalex.org/W2991072578","https://openalex.org/W2999580712","https://openalex.org/W3166605709","https://openalex.org/W3186781242","https://openalex.org/W3199832604","https://openalex.org/W4220653067","https://openalex.org/W4229054548","https://openalex.org/W4385772980","https://openalex.org/W4386800720","https://openalex.org/W4387258816","https://openalex.org/W4391271052"],"related_works":[],"abstract_inverted_index":{"To":[0],"measure":[1],"the":[2,16,19,28,34,114,150,157,160,169],"tree-likeness":[3],"of":[4,18,37,89,95,116,141,159],"a":[5,10,93,132],"directed":[6],"acyclic":[7],"graph":[8],"(DAG),":[9],"new":[11],"width":[12],"parameter":[13],"that":[14,31,134,149,166],"considers":[15],"directions":[17],"arcs":[20],"was":[21],"recently":[22],"introduced:":[23],"scanwidth":[24,36,46,115,151],".":[25],"We":[26],"present":[27],"first":[29],"algorithm":[30,62,68,105],"efficiently":[32],"computes":[33],"exact":[35],"general":[38],"DAGs.":[39],"For":[40],"DAGs":[41],"with":[42,69],"one":[43],"root":[44],"and":[45,123],"k":[47,53,56],"it":[48],"runs":[49],"in":[50,108,173],"O":[51,71],"(":[52,72],"\u22c5":[54,57,78,80],"n":[55,81,83],"m":[58],")":[59,85],"time.":[60],"The":[61],"also":[63],"functions":[64],"as":[65],"an":[66,136],"FPT":[67],"complexity":[70],"2":[73,84],"4":[74],"\u2113":[75,79,91],"\u2212":[76],"1":[77],"+":[82],"for":[86,167],"phylogenetic":[87],"networks":[88,118,168],"level-":[90],",":[92],"type":[94],"DAG":[96],"used":[97],"to":[98,112,120],"depict":[99],"evolutionary":[100],"relationships":[101],"among":[102],"species.":[103],"Our":[104],"performs":[106],"well":[107],"practice,":[109],"being":[110],"able":[111],"compute":[113],"synthetic":[117],"up":[119],"30":[121],"reticulations":[122],"100":[124],"leaves":[125],"within":[126],"500":[127],"seconds.":[128],"Furthermore,":[129],"we":[130,147],"propose":[131],"heuristic":[133],"obtains":[135],"average":[137],"practical":[138],"approximation":[139],"ratio":[140],"1.5":[142],"on":[143],"these":[144],"networks.":[145],"While":[146],"prove":[148],"is":[152],"bounded":[153],"from":[154],"below":[155],"by":[156],"treewidth":[158],"underlying":[161],"undirected":[162],"graph,":[163],"experiments":[164],"suggest":[165],"parameters":[170],"are":[171],"close":[172],"practice.":[174]},"counts_by_year":[],"updated_date":"2026-04-09T06:08:40.794217","created_date":"2026-02-20T00:00:00"}