{"id":"https://openalex.org/W2018995959","doi":"https://doi.org/10.1137/050639879","title":"New Acyclic and Star Coloring Algorithms with Application to Computing Hessians","display_name":"New Acyclic and Star Coloring Algorithms with Application to Computing Hessians","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2018995959","doi":"https://doi.org/10.1137/050639879","mag":"2018995959"},"language":"en","primary_location":{"id":"doi:10.1137/050639879","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050639879","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049685547","display_name":"Assefaw H. Gebremedhin","orcid":"https://orcid.org/0000-0001-5383-8032"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Assefaw H. Gebremedhin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028861854","display_name":"Arijit Tarafdar","orcid":"https://orcid.org/0009-0005-0549-8383"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arijit Tarafdar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091535574","display_name":"Fredrik Manne","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fredrik Manne","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055182869","display_name":"Alex Pothen","orcid":"https://orcid.org/0000-0002-3421-3325"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alex Pothen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049685547"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1093,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.93678553,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"3","first_page":"1042","last_page":"1072"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9984999895095825,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9804999828338623,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6256271004676819},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.616172194480896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.588281512260437},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5633136630058289},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5519671440124512},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.5200733542442322},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4774820804595947},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.4610629975795746},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4521482288837433},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4513886272907257},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4371914863586426},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43641912937164307},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4208710789680481},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4162842035293579},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.3865474760532379},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27425891160964966},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08627796173095703},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08263334631919861},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.08196592330932617}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6256271004676819},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.616172194480896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.588281512260437},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5633136630058289},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5519671440124512},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.5200733542442322},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4774820804595947},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.4610629975795746},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4521482288837433},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4513886272907257},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4371914863586426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43641912937164307},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4208710789680481},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4162842035293579},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3865474760532379},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27425891160964966},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08627796173095703},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08263334631919861},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.08196592330932617},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/050639879","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050639879","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.120.1310","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.1310","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.odu.edu/~assefaw/pub/acyclic-SISC.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W204341840","https://openalex.org/W345637930","https://openalex.org/W1523448599","https://openalex.org/W1585773866","https://openalex.org/W1963564197","https://openalex.org/W1972168259","https://openalex.org/W1972400398","https://openalex.org/W1979545228","https://openalex.org/W1988783936","https://openalex.org/W1994309501","https://openalex.org/W1995561370","https://openalex.org/W2003363022","https://openalex.org/W2029746920","https://openalex.org/W2044733003","https://openalex.org/W2068155033","https://openalex.org/W2117592165","https://openalex.org/W2124855066","https://openalex.org/W2126040859","https://openalex.org/W2133400152","https://openalex.org/W2135959058","https://openalex.org/W2136871634","https://openalex.org/W2143263735","https://openalex.org/W2145519285","https://openalex.org/W2156149469","https://openalex.org/W2162166182","https://openalex.org/W2171679443","https://openalex.org/W3145128584","https://openalex.org/W4213087285"],"related_works":["https://openalex.org/W4288422293","https://openalex.org/W3177037008","https://openalex.org/W2003971350","https://openalex.org/W2766269674","https://openalex.org/W3107333841","https://openalex.org/W2050854321","https://openalex.org/W4287598225","https://openalex.org/W3101541854","https://openalex.org/W3006791531","https://openalex.org/W2065534336"],"abstract_inverted_index":{"Acyclic":[0],"and":[1,27,66,161,186],"star":[2,74,153],"coloring":[3,8,75,111,149,154],"problems":[4,9],"are":[5,29,184],"specialized":[6],"vertex":[7,84,102],"that":[10,181],"arise":[11],"in":[12,103,196],"the":[13,50,53,69,87,120,134,142,147,152,182],"efficient":[14],"computation":[15,198],"of":[16,52,55,72,83,90,93,108,122,128,136,193],"Hessians":[17],"using":[18],"automatic":[19],"differentiation":[20],"or":[21],"finite":[22],"differencing,":[23],"when":[24],"both":[25,129],"sparsity":[26],"symmetry":[28],"exploited.":[30],"We":[31],"present":[32],"an":[33],"algorithmic":[34],"paradigm":[35],"for":[36,40,146],"finding":[37],"heuristic":[38],"solutions":[39],"these":[41,194],"two":[42],"NP\u2010hard":[43],"problems.":[44],"The":[45,105,125,191],"underlying":[46],"common":[47],"technique":[48],"is":[49,77,113,131,141,162,199],"exploitation":[51],"structure":[54],"two\u2010colored":[56],"induced":[57],"subgraphs.":[58],"For":[59,151],"a":[60,81,101,116,166],"graph":[61],"G":[62],"on":[63,175],"n":[64],"vertices":[65],"m":[67],"edges,":[68],"time":[70,106],"complexity":[71,107,127],"our":[73,109,137,139,156],"algorithm":[76,112,145,157],"$O(n\\overline{d}_2)$,":[78],"where":[79],"$\\overline{d}_k$,":[80],"generalization":[82],"degree,":[85],"denotes":[86],"average":[88],"number":[89],"distinct":[91],"paths":[92],"length":[94],"at":[95,100],"most":[96],"k":[97],"edges":[98],"starting":[99],"G.":[104],"acyclic":[110,148],"larger":[114],"by":[115],"multiplicative":[117],"factor":[118],"involving":[119],"inverse":[121],"Ackermann\u2019s":[123],"function.":[124],"space":[126],"algorithms":[130,183,195],"$O(m)$.":[132],"To":[133],"best":[135],"knowledge,":[138],"work":[140],"first":[143],"practical":[144],"problem.":[150],"problem,":[155],"uses":[158],"fewer":[159],"colors":[160],"considerably":[163],"faster":[164],"than":[165],"previously":[167],"known":[168],"$O(n\\overline{d}_3)$\u2010time":[169],"algorithm.":[170],"Computational":[171],"results":[172],"from":[173],"experiments":[174],"various":[176],"large\u2010size":[177],"test":[178],"graphs":[179],"demonstrate":[180],"fast":[185],"produce":[187],"highly":[188],"effective":[189],"solutions.":[190],"use":[192],"Hessian":[197],"expected":[200],"to":[201],"reduce":[202],"overall":[203],"runtime":[204],"drastically.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}