{"id":"https://openalex.org/W2885131583","doi":"https://doi.org/10.1145/3212734.3212787","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2018,"publication_date":"2018-07-23","ids":{"openalex":"https://openalex.org/W2885131583","doi":"https://doi.org/10.1145/3212734.3212787","mag":"2885131583"},"language":"en","primary_location":{"id":"doi:10.1145/3212734.3212787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3212734.3212787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-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/A5054336577","display_name":"Christian Konrad","orcid":"https://orcid.org/0000-0003-1802-4011"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Christian Konrad","raw_affiliation_strings":["University of Bristol, Bristol, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Bristol, Bristol, United Kingdom","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047948708","display_name":"Viktor Zamaraev","orcid":"https://orcid.org/0000-0001-5755-4141"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Viktor Zamaraev","raw_affiliation_strings":["Durham University, Durham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Durham University, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054336577"],"corresponding_institution_ids":["https://openalex.org/I36234482"],"apc_list":null,"apc_paid":null,"fwci":0.641,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71745507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"159","last_page":"161"},"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.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9940999746322632,"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/computer-science","display_name":"Computer science","score":0.49697616696357727}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49697616696357727}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3212734.3212787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3212734.3212787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/d1f2eeb2-fa0f-44f6-b262-6cd8be5a609a","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/d1f2eeb2-fa0f-44f6-b262-6cd8be5a609a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Konrad, C & Zamaraev, V 2018, Brief announcement : Distributed minimum vertex coloring and maximum independent set in chordal graphs. in PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, pp. 159-161. https://doi.org/10.1145/3212734.3212787","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3046054759","display_name":null,"funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G967227458","display_name":null,"funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1502920553","https://openalex.org/W1666479227","https://openalex.org/W1869515244","https://openalex.org/W1964089073","https://openalex.org/W1980501142","https://openalex.org/W2022155283","https://openalex.org/W2054910423","https://openalex.org/W2067661972","https://openalex.org/W2100061495","https://openalex.org/W2136749024","https://openalex.org/W2137594557","https://openalex.org/W2169102947","https://openalex.org/W2169324896","https://openalex.org/W2467514673","https://openalex.org/W2503706701","https://openalex.org/W2552279664","https://openalex.org/W2610183793","https://openalex.org/W2772780650","https://openalex.org/W2803082133"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"We":[0],"give":[1],"deterministic":[2],"distributed":[3],"(1+\u03b5)-approximation":[4],"algorithms":[5],"for":[6],"Minimum":[7],"Vertex":[8],"Coloring":[9],"and":[10,30,59],"Maximum":[11],"Independent":[12],"Set":[13],"on":[14,57],"chordal":[15],"graphs":[16],"in":[17,25],"the":[18,55],"LOCAL":[19],"model.":[20],"Our":[21],"coloring":[22],"algorithm":[23,34],"runs":[24],"O(":[26,39],"1/\u03b5":[27,43,58,71],"logn)":[28],"rounds,":[29],"our":[31],"independent":[32,65],"set":[33],"has":[35],"a":[36],"runtime":[37],"of":[38],"1":[40],"\u03b5":[41],"log(":[42],")":[44,72],"log?":[45],"n)":[46],"rounds.":[47],"For":[48,64],"coloring,":[49],"existing":[50],"lower":[51],"bounds":[52],"imply":[53],"that":[54,69],"dependencies":[56],"logn":[60],"are":[61,74],"best":[62],"possible.":[63],"set,":[66],"we":[67],"prove":[68],"\u03a9(":[70],"rounds":[73],"necessary.":[75]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2018-08-22T00:00:00"}