{"id":"https://openalex.org/W7162451333","doi":"https://doi.org/10.48550/arxiv.2605.24280","title":"A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation","display_name":"A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation","publication_year":2026,"publication_date":"2026-05-22","ids":{"openalex":"https://openalex.org/W7162451333","doi":"https://doi.org/10.48550/arxiv.2605.24280"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.24280","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.24280","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.24280","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136994005","display_name":"Alex Crane","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Crane, Alex","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064442594","display_name":"P\u00e5l Gr\u00f8n\u00e5s Drange","orcid":"https://orcid.org/0000-0001-7228-6640"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Drange, P\u00e5l Gr\u00f8n\u00e5s","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137060205","display_name":"Eli Friedman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Friedman, Eli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067040957","display_name":"Paul Hovland","orcid":"https://orcid.org/0000-0002-0907-2567"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hovland, Paul D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102822838","display_name":"Jan H\u00fcckelheim","orcid":"https://orcid.org/0000-0003-4918-5627"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H\u00fcckelheim, Jan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137052953","display_name":"Andrew Lyons","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lyons, Andrew","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137019379","display_name":"Yosuke Mizutani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mizutani, Yosuke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137067780","display_name":"Mac\u00e9o Ottavy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ottavy, Mac\u00e9o","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128178423","display_name":"Blair D. Sullivan (5933777)","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sullivan, Blair D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.23579999804496765,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.23579999804496765,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.16920000314712524,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.11659999936819077,"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/heuristics","display_name":"Heuristics","score":0.6786999702453613},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5586000084877014},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5509999990463257},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5468999743461609},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4970000088214874},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47350001335144043},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43639999628067017},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.424699991941452},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3668999969959259}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6786999702453613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5756999850273132},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5586000084877014},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5509999990463257},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5468999743461609},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4970000088214874},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46810001134872437},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.424699991941452},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40470001101493835},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3628000020980835},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3244999945163727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3183000087738037},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2669000029563904},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.24280","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.24280","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.24280","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.24280","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"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,22],"algorithmic":[1],"differentiation":[2],"(AD)":[3],"of":[4,13,24,47,50,75,108,117,120,134,159,165,187],"mathematical":[5],"functions":[6],"can":[7],"be":[8],"interpreted":[9],"as":[10],"a":[11,26,93,118,132,156,173,188],"sequence":[12],"vertex":[14],"eliminations":[15],"in":[16,59],"an":[17],"underlying":[18],"directed":[19],"acyclic":[20],"graph.":[21],"problem":[23],"determining":[25],"minimum-cost":[27],"elimination":[28],"ordering,":[29],"which":[30,124],"we":[31,96,196],"call":[32,97],"Optimal":[33,88,177],"Vertex":[34,89,178],"Elimination,":[35],"is":[36],"NP-complete.":[37],"Consequently,":[38],"much":[39],"effort":[40],"has":[41,64],"been":[42,67],"devoted":[43],"to":[44,56,69,72,104,171],"the":[45,73,115,160,185,193,198],"design":[46,80],"heuristics.":[48],"Many":[49],"these":[51],"heuristics":[52],"are":[53,127],"widely":[54],"believed":[55],"perform":[57],"well":[58],"practice,":[60],"but":[61],"this":[62],"hypothesis":[63],"so":[65],"far":[66],"difficult":[68],"test":[70],"due":[71],"lack":[74],"scalable":[76],"exact":[77],"methods.":[78],"We":[79,148,154],"and":[81,91,162,167],"engineer":[82],"new":[83],"integer":[84],"programming":[85],"formulations":[86],"for":[87,92,123,176,203],"Eliminatioin":[90],"related":[94],"objective":[95],"Minimum":[98],"Edge":[99],"Count.":[100],"Our":[101],"implementations":[102],"scale":[103],"graphs":[105,122],"one-to-two":[106],"orders":[107],"magnitude":[109],"larger":[110],"than":[111],"existing":[112,135],"techniques,":[113],"enabling":[114],"assembly":[116],"corpus":[119,130],"medium-sized":[121],"optimal":[125],"solutions":[126],"known.":[128],"This":[129],"facilitates":[131],"study":[133],"heuristics,":[136],"confirming":[137],"that":[138],"on":[139],"real":[140],"data":[141],"popular":[142],"methods":[143],"achieve":[144],"high":[145],"quality":[146],"solutions.":[147],"also":[149],"make":[150],"several":[151],"theoretical":[152],"contributions.":[153],"give":[155,197],"tight":[157],"analysis":[158],"forward":[161],"reverse":[163],"modes":[164],"AD,":[166],"extend":[168],"our":[169],"techniques":[170],"provide":[172],"simple":[174],"algorithm":[175],"Elimination":[179],"with":[180],"approximation":[181,200],"ratio":[182],"parameterized":[183],"by":[184],"size":[186],"minimum":[189],"source-sink":[190],"separator.":[191],"On":[192],"complexity":[194],"side,":[195],"first":[199],"lower":[201],"bounds":[202],"both":[204],"problems.":[205]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-27T00:00:00"}