{"id":"https://openalex.org/W2004394201","doi":"https://doi.org/10.1007/s10878-010-9290-1","title":"Max-coloring paths: tight bounds and extensions","display_name":"Max-coloring paths: tight bounds and extensions","publication_year":2010,"publication_date":"2010-01-27","ids":{"openalex":"https://openalex.org/W2004394201","doi":"https://doi.org/10.1007/s10878-010-9290-1","mag":"2004394201"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-010-9290-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-010-9290-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-010-9290-1.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-010-9290-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["Indian Institute of Science, Bangalore, India","Indian Inst. of Science, Bangalore  India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Indian Inst. of Science, Bangalore  India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007528822","display_name":"Juli\u00e1n Mestre","orcid":"https://orcid.org/0000-0003-4948-2998"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Juli\u00e1n Mestre","raw_affiliation_strings":["Max-Plank-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Plank-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062523877"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":1.0036,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.7582643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"1","first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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.9972000122070312,"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/combinatorics","display_name":"Combinatorics","score":0.8309242129325867},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.7313694953918457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6804571747779846},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.6703271865844727},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5842181444168091},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5777847766876221},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.576659083366394},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5558812022209167},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5047541856765747},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.4424419403076172},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4307636618614197},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4210489094257355},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35546237230300903},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13010570406913757},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09993821382522583}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8309242129325867},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.7313694953918457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6804571747779846},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.6703271865844727},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5842181444168091},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5777847766876221},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.576659083366394},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5558812022209167},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5047541856765747},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.4424419403076172},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4307636618614197},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4210489094257355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35546237230300903},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13010570406913757},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09993821382522583},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-010-9290-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-010-9290-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-010-9290-1.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:24:y:2012:i:1:d:10.1007_s10878-010-9290-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-010-9290-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:edoc.mpg.de:536728","is_oa":false,"landing_page_url":"http://edoc.mpg.de/536728","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, v.Online First, 1-14 (2010)","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s10878-010-9290-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-010-9290-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-010-9290-1.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2004394201.pdf","grobid_xml":"https://content.openalex.org/works/W2004394201.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1498089635","https://openalex.org/W1542595106","https://openalex.org/W1602103078","https://openalex.org/W1932992293","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W2028503265","https://openalex.org/W2029120932","https://openalex.org/W2039179345","https://openalex.org/W2103286310","https://openalex.org/W2130766066","https://openalex.org/W2169017439","https://openalex.org/W2175374991","https://openalex.org/W2341350247","https://openalex.org/W2491873545","https://openalex.org/W4239337465"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4297911588","https://openalex.org/W2793500002","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W4296943582","https://openalex.org/W3157287446","https://openalex.org/W2175082514","https://openalex.org/W151506147","https://openalex.org/W4212987857"],"abstract_inverted_index":{"The":[0],"max-coloring":[1,38,78,88,93,112],"problem":[2,86],"is":[3,24,39,75],"to":[4],"compute":[5],"a":[6,13,48,96,132],"legal":[7],"coloring":[8,46],"of":[9,12,51,87,99,136],"the":[10,31,43,52,85,121,140],"vertices":[11,55],"graph":[14],"G=(V,E)":[15],"with":[16],"vertex":[17,45,122,125],"weights":[18,126],"w":[19],"such":[20],"that":[21,101,111],"$\\sum_{i=1}^{k}\\max_{v\\in":[22],"C_{i}}w(v_{i})$":[23],"minimized,":[25],"where":[26,54],"C":[27],"1,\u2026,C":[28],"k":[29],"are":[30,127],"various":[32],"color":[33],"classes.":[34],"For":[35,106],"general":[36],"graphs,":[37,108],"as":[40,42],"hard":[41],"classical":[44],"problem,":[47],"special":[49],"case":[50],"former":[53],"have":[56],"unit":[57],"weight.":[58],"In":[59,80],"fact,":[60],"in":[61,116,139],"some":[62],"cases":[63],"it":[64],"can":[65,113],"even":[66],"be":[67,114],"harder:":[68],"for":[69,77,119],"example,":[70],"no":[71],"polynomial":[72],"time":[73,117],"algorithm":[74],"known":[76],"trees.":[79],"this":[81],"paper":[82],"we":[83,109,130],"consider":[84],"paths":[89,103],"and":[90,104],"its":[91],"generalization,":[92],"skinny":[94],"trees,":[95],"broad":[97],"class":[98],"trees":[100],"includes":[102],"spiders.":[105],"these":[107],"show":[110,131],"solved":[115],"O(|V|+time":[118],"sorting":[120],"weights).":[123],"When":[124],"real":[128],"numbers,":[129],"matching":[133],"lower":[134],"bound":[135],"\u03a9(|V|log":[137],"|V|)":[138],"algebraic":[141],"computation":[142],"tree":[143],"model.":[144]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}