{"id":"https://openalex.org/W2906112604","doi":"https://doi.org/10.1109/tpds.2018.2889688","title":"Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks","display_name":"Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks","publication_year":2018,"publication_date":"2018-12-25","ids":{"openalex":"https://openalex.org/W2906112604","doi":"https://doi.org/10.1109/tpds.2018.2889688","mag":"2906112604"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2018.2889688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2018.2889688","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","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/A5061223426","display_name":"Hicham Lakhlef","orcid":"https://orcid.org/0000-0003-3005-9727"},"institutions":[{"id":"https://openalex.org/I102516824","display_name":"Universit\u00e9 de Technologie de Compi\u00e8gne","ror":"https://ror.org/04y5kwa70","country_code":"FR","type":"education","lineage":["https://openalex.org/I102516824"]},{"id":"https://openalex.org/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Hicham Lakhlef","raw_affiliation_strings":["Universit\u00e9 Technologique de Compi\u00e8gne (UTC), Compi\u00e8gne, France","Heudiasyc - Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne] (UTC, CS 60319 - 57 avenue de Landshut - 60203 Compi\u00e8gne cedex - France)"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Technologique de Compi\u00e8gne (UTC), Compi\u00e8gne, France","institution_ids":["https://openalex.org/I102516824"]},{"raw_affiliation_string":"Heudiasyc - Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne] (UTC, CS 60319 - 57 avenue de Landshut - 60203 Compi\u00e8gne cedex - France)","institution_ids":["https://openalex.org/I4210088387","https://openalex.org/I102516824"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001545243","display_name":"Michel Raynal","orcid":"https://orcid.org/0000-0002-3355-8719"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["FR","HK"],"is_corresponding":false,"raw_author_name":"Michel Raynal","raw_affiliation_strings":["Polytechnic University of Hong Kong, Hung Hom, Hong Kong","WIDE - the World Is Distributed Exploring the tension between scale and coordination (Centre Inria de l'Universit\u00e9 de Rennes\r\nCampus de Beaulieu\r\n263 Av. G\u00e9n\u00e9ral Leclerc\r\n35042 Rennes - France)"],"affiliations":[{"raw_affiliation_string":"Polytechnic University of Hong Kong, Hung Hom, Hong Kong","institution_ids":["https://openalex.org/I14243506","https://openalex.org/I889458895"]},{"raw_affiliation_string":"WIDE - the World Is Distributed Exploring the tension between scale and coordination (Centre Inria de l'Universit\u00e9 de Rennes\r\nCampus de Beaulieu\r\n263 Av. G\u00e9n\u00e9ral Leclerc\r\n35042 Rennes - France)","institution_ids":["https://openalex.org/I56067802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061628886","display_name":"Fran\u00e7ois Ta\u0131\u0308ani","orcid":"https://orcid.org/0000-0002-9692-5678"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Francois Taiani","raw_affiliation_strings":["CNRS, Inria, IRISA, University of Rennes, Rennes, France","WIDE - the World Is Distributed Exploring the tension between scale and coordination (Centre Inria de l'Universit\u00e9 de Rennes\r\nCampus de Beaulieu\r\n263 Av. G\u00e9n\u00e9ral Leclerc\r\n35042 Rennes - France)"],"affiliations":[{"raw_affiliation_string":"CNRS, Inria, IRISA, University of Rennes, Rennes, France","institution_ids":["https://openalex.org/I56067802","https://openalex.org/I2802519937","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"WIDE - the World Is Distributed Exploring the tension between scale and coordination (Centre Inria de l'Universit\u00e9 de Rennes\r\nCampus de Beaulieu\r\n263 Av. G\u00e9n\u00e9ral Leclerc\r\n35042 Rennes - France)","institution_ids":["https://openalex.org/I56067802"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061223426"],"corresponding_institution_ids":["https://openalex.org/I102516824","https://openalex.org/I4210088387"],"apc_list":null,"apc_paid":null,"fwci":1.6608,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.8625645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"7","first_page":"1672","last_page":"1686"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9850999712944031,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9850999712944031,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9684000015258789,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9229999780654907,"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/correctness","display_name":"Correctness","score":0.651527464389801},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6352288126945496},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6207906603813171},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6151137948036194},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.576237142086029},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5532707571983337},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47517508268356323},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4617156684398651},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4580281376838684},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.41208183765411377},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40817540884017944},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39950597286224365},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3835292458534241},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3367588520050049},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3055054843425751},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28167200088500977},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.146622896194458}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.651527464389801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6352288126945496},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6207906603813171},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6151137948036194},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.576237142086029},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5532707571983337},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47517508268356323},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4617156684398651},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4580281376838684},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.41208183765411377},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40817540884017944},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39950597286224365},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3835292458534241},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3367588520050049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3055054843425751},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28167200088500977},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.146622896194458},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tpds.2018.2889688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2018.2889688","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02376726v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-02376726","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","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":"IEEE Transactions on Parallel and Distributed Systems, 2019, 30 (7), pp.1672-1686. ⟨10.1109/TPDS.2018.2889688⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W564832898","https://openalex.org/W1905972793","https://openalex.org/W1981926792","https://openalex.org/W1992776880","https://openalex.org/W1995489825","https://openalex.org/W2001315747","https://openalex.org/W2017454576","https://openalex.org/W2024071264","https://openalex.org/W2032265004","https://openalex.org/W2048357050","https://openalex.org/W2070148795","https://openalex.org/W2126726492","https://openalex.org/W2132179384","https://openalex.org/W2136185479","https://openalex.org/W2139045887","https://openalex.org/W2139965668","https://openalex.org/W2148158683","https://openalex.org/W2161438373","https://openalex.org/W2336597783","https://openalex.org/W2611515161","https://openalex.org/W2963836184","https://openalex.org/W3106753174","https://openalex.org/W4205300528","https://openalex.org/W4210634265","https://openalex.org/W4251986490","https://openalex.org/W6683925045","https://openalex.org/W6703670829"],"related_works":["https://openalex.org/W4291316360","https://openalex.org/W2793500002","https://openalex.org/W4311345810","https://openalex.org/W4294957130","https://openalex.org/W3169197204","https://openalex.org/W2780971292","https://openalex.org/W1602536203","https://openalex.org/W151506147","https://openalex.org/W2046652778","https://openalex.org/W1542397451"],"abstract_inverted_index":{"This":[0],"paper":[1,51,79],"considers":[2],"distributed":[3,117],"vertex-coloring":[4],"in":[5,56,96,106],"broadcast/receive":[6],"networks":[7],"suffering":[8],"from":[9,72],"conflicts":[10],"and":[11,38,108,115,122],"collisions.":[12],"(A":[13],"collision":[14],"occurs":[15,34],"when,":[16],"during":[17,44],"the":[18,25,45,50,87,104],"same":[19,26,46],"round,":[20],"messages":[21],"are":[22],"sent":[23],"to":[24,65],"process":[27,37,59],"by":[28],"too":[29],"many":[30],"neighbors;":[31],"a":[32,36,58,63,70,82,110],"conflict":[33],"when":[35],"one":[39],"of":[40,76],"its":[41,66,124],"neighbors":[42,67],"broadcast":[43,62],"round.)":[47],"More":[48],"specifically,":[49],"focuses":[52],"on":[53,86],"multi-channel":[54],"networks,":[55],"which":[57],"may":[60],"either":[61],"message":[64,71],"or":[68],"receive":[69],"at":[73],"most":[74],"\u03b3":[75],"them.":[77],"The":[78],"first":[80],"provides":[81],"new":[83],"upper":[84],"bound":[85,102],"corresponding":[88],"graph":[89],"coloring":[90,118],"problem":[91,105],"(known":[92],"as":[93],"frugal":[94],"coloring)":[95],"general":[97],"graphs,":[98],"proposes":[99],"an":[100],"exact":[101],"for":[103,120],"trees,":[107,121],"presents":[109],"deterministic,":[111],"parallel,":[112],"color-optimal,":[113],"collision-":[114],"conflict-free":[116],"algorithm":[119],"proves":[123],"correctness.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}