{"id":"https://openalex.org/W7225388131","doi":"https://doi.org/10.1002/net.70089","title":"Analysis of Greedy Algorithms for Chromatic Sum Coloring of a Graph","display_name":"Analysis of Greedy Algorithms for Chromatic Sum Coloring of a Graph","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225388131","doi":"https://doi.org/10.1002/net.70089"},"language":"en","primary_location":{"id":"doi:10.1002/net.70089","doi":"https://doi.org/10.1002/net.70089","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70089","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70089","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70089","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081626234","display_name":"Marek Kubale","orcid":"https://orcid.org/0000-0001-9460-3782","observed_orcids":["https://orcid.org/0000-0001-9460-3782"]},"institutions":[{"id":"https://openalex.org/I4210125238","display_name":"Gdynia Maritime University","ror":"https://ror.org/02vscf791","country_code":"PL","type":"education","lineage":["https://openalex.org/I4210125238"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Kubale","raw_affiliation_strings":["Faculty of Computer Science Gdynia Maritime University  Gdynia Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science Gdynia Maritime University  Gdynia Poland","institution_ids":["https://openalex.org/I4210125238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008466251","display_name":"Bartosz Kamedulski","orcid":"https://orcid.org/0000-0002-5000-3758","observed_orcids":["https://orcid.org/0000-0002-5000-3758"]},"institutions":[{"id":"https://openalex.org/I4210125238","display_name":"Gdynia Maritime University","ror":"https://ror.org/02vscf791","country_code":"PL","type":"education","lineage":["https://openalex.org/I4210125238"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Bartosz Kamedulski","raw_affiliation_strings":["Faculty of Computer Science Gdynia Maritime University  Gdynia Poland"],"raw_orcid":"https://orcid.org/0000-0002-5000-3758","affiliations":[{"raw_affiliation_string":"Faculty of Computer Science Gdynia Maritime University  Gdynia Poland","institution_ids":["https://openalex.org/I4210125238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008466251"],"corresponding_institution_ids":["https://openalex.org/I4210125238"],"apc_list":{"value":3750,"currency":"USD","value_usd":3750},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.635699987411499,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.635699987411499,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.19099999964237213,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.12950000166893005,"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/vertex-ordering","display_name":"vertex ordering","score":0.6129999756813049},{"id":"https://openalex.org/keywords/performance-evaluation","display_name":"performance evaluation","score":0.38199999928474426},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.5830000042915344},{"id":"https://openalex.org/keywords/timetabling","display_name":"timetabling","score":0.6980000138282776},{"id":"https://openalex.org/keywords/mean-flow-time","display_name":"mean flow time","score":0.7139999866485596},{"id":"https://openalex.org/keywords/total-completion-time","display_name":"total completion time","score":0.7089999914169312},{"id":"https://openalex.org/keywords/polynomial-time-approximation-algorithms","display_name":"polynomial-time approximation algorithms","score":0.6100000143051147}],"concepts":[{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.8122000098228455},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.7667999863624573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7475000023841858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6517999768257141},{"id":"https://openalex.org/C2778552271","wikidata":"https://www.wikidata.org/wiki/Q7828102","display_name":"Total coloring","level":5,"score":0.6308000087738037},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.6126999855041504},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5968000292778015},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5903000235557556},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5439000129699707},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.5239999890327454},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49729999899864197},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4763000011444092},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.4595000147819519},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44850000739097595},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.3808000087738037},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33889999985694885},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.31459999084472656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2962999939918518},{"id":"https://openalex.org/C167750561","wikidata":"https://www.wikidata.org/wiki/Q1789512","display_name":"Critical graph","level":5,"score":0.29510000348091125},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.2750000059604645},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.70089","doi":"https://doi.org/10.1002/net.70089","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70089","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70089","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/net.70089","doi":"https://doi.org/10.1002/net.70089","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.70089","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.70089","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-c","cwts-core","dongbi-b","jufo-2","norway-1","poland-140","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225388131.pdf","grobid_xml":"https://content.openalex.org/works/W7225388131.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W149461665","https://openalex.org/W1980672031","https://openalex.org/W1995561370","https://openalex.org/W2020972111","https://openalex.org/W2040924621","https://openalex.org/W2083692180","https://openalex.org/W2108301529","https://openalex.org/W2125304782","https://openalex.org/W2167036627","https://openalex.org/W2925439568","https://openalex.org/W4210704893","https://openalex.org/W4402483366"],"related_works":["https://openalex.org/W1527344222","https://openalex.org/W2012711355","https://openalex.org/W1973571353","https://openalex.org/W7220037959","https://openalex.org/W2890474798","https://openalex.org/W2930272015","https://openalex.org/W7098405455","https://openalex.org/W4301476756","https://openalex.org/W1556157567","https://openalex.org/W2017360257"],"abstract_inverted_index":{"ABSTRACT":[0],"Sum":[1],"coloring":[2,9,55,83,126],"of":[3,19,44,64,99,120,159,198,215,235],"a":[4,7,53,79,87,183,195,226],"graph":[5,46,54,125,229],"is":[6,36,103,202,230],"vertex":[8,207],"using":[10],"positive":[11],"integers":[12],"(colors)":[13],"that":[14,77,89,174,190,225],"minimizes":[15,90],"the":[16,20,37,45,75,91,121,157,171,179,205,232],"total":[17,39,96,196],"sum":[18,35,82,161,184,197],"colors":[21,199],"assigned":[22],"to":[23,61,85,109,156],"all":[24,41],"vertices,":[25],"where":[26],"adjacent":[27],"vertices":[28],"must":[29],"have":[30],"different":[31],"colors.":[32],"The":[33,48],"chromatic":[34,81,160],"smallest":[38,172],"among":[40],"proper":[42],"colorings":[43],".":[47],"need":[49],"for":[50,133,231],"considering":[51],"such":[52,165],"model":[56],"follows":[57],"from":[58,74],"its":[59,169,216],"application":[60],"solve":[62],"problems":[63],"scheduling":[65],"equal":[66],"length":[67],"tasks":[68],"(e.g.,":[69],"university":[70],"timetables).":[71],"It":[72],"stems":[73],"fact":[76],"finding":[78,86],"minimum":[80],"corresponds":[84],"schedule":[88],"mean":[92],"flow":[93],"time":[94,98],"and":[95,130,146,188,219],"completion":[97],"tasks.":[100],"Unfortunately,":[101],"evaluating":[102],"NP\u2010hard.":[104],"Therefore,":[105],"we":[106,117,167,223],"are":[107],"forced":[108],"use":[110],"polynomial\u2010time":[111],"approximation":[112],"algorithms.":[113],"In":[114],"this":[115],"article,":[116],"analyze":[118],"four":[119],"most":[122],"popular":[123],"greedy":[124],"algorithms:":[127],",":[128,129,131,136,139,150,173,189],"standing":[132],"Largest":[134,141],"First":[135,142],"Smallest":[137],"Last":[138],"Saturation":[140],"(":[143],"DSatur":[144],")":[145,187],"Greedy":[147],"Independent":[148],"Sets":[149],"along":[151],"with":[152],"their":[153],"improvements":[154],"adapted":[155],"needs":[158],"coloring.":[162],"For":[163],"any":[164],"algorithm,":[166],"give":[168],"description,":[170],"is,":[175,191],"hard\u2010to\u2010color":[176,193],"(for":[177],"which":[178],"algorithm":[180],"always":[181],"yields":[182],"greater":[185,200],"than":[186,201],"slightly":[192],"(where":[194],"possible":[203],"under":[204,237],"worst\u2010case":[206],"ordering)":[208],"graphs,":[209],"as":[210,212],"well":[211],"an":[213],"estimation":[214],"computational":[217],"complexity":[218],"performance":[220],"function.":[221],"Finally,":[222],"show":[224],"certain":[227],"8\u2010vertex":[228],"whole":[233],"collection":[234],"algorithms":[236],"consideration.":[238]},"counts_by_year":[],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2026-11-07T00:00:00"}