{"id":"https://openalex.org/W2082903339","doi":"https://doi.org/10.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.0.co;2-s","title":"Nearly optimal distributed edge coloring in O(log log n) rounds","display_name":"Nearly optimal distributed edge coloring in O(log log n) rounds","publication_year":1997,"publication_date":"1997-05-01","ids":{"openalex":"https://openalex.org/W2082903339","doi":"https://doi.org/10.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.0.co;2-s","mag":"2082903339"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.0.co;2-s","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.0.co;2-s","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Random Structures and Algorithms","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/A5068835095","display_name":"David A. Grable","orcid":null},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"David A. Grable","raw_affiliation_strings":["Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, D-10099 Berlin, Germany","Humboldt Universit\u00e1t zu Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, D-10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt Universit\u00e1t zu Berlin","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063633119","display_name":"Alessandro Panconesi","orcid":"https://orcid.org/0000-0002-2169-3067"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alessandro Panconesi","raw_affiliation_strings":["Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, D-10099 Berlin, Germany","Humboldt Universit\u00e1t zu Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut fu\u0308r Informatik, Humboldt-Universita\u0308t zu Berlin, Unter den Linden 6, D-10099 Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt Universit\u00e1t zu Berlin","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068835095"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":4.6026,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.95006449,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"10","issue":"3","first_page":"385","last_page":"405"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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.9954000115394592,"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/binary-logarithm","display_name":"Binary logarithm","score":0.7665430903434753},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6223981380462646},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6142794489860535},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5338747501373291},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5263553857803345},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5060679316520691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4808248281478882},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4696962833404541},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43937334418296814},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4194157123565674},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3938288986682892},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39163610339164734},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.16414961218833923},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15567371249198914},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.06071445345878601}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7665430903434753},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6223981380462646},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6142794489860535},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5338747501373291},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5263553857803345},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5060679316520691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4808248281478882},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4696962833404541},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43937334418296814},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4194157123565674},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3938288986682892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39163610339164734},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.16414961218833923},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15567371249198914},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.06071445345878601},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.0.co;2-s","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1098-2418(199705)10:3<385::aid-rsa6>3.0.co;2-s","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Random Structures and Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324094","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40"},{"id":"https://openalex.org/F4320324521","display_name":"Freie Universit\u00e4t Berlin","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1966769222","https://openalex.org/W1977820641","https://openalex.org/W1982513108","https://openalex.org/W1996066664","https://openalex.org/W1998643836","https://openalex.org/W2024769658","https://openalex.org/W2027586324","https://openalex.org/W2042703645","https://openalex.org/W2057128446","https://openalex.org/W2080228317","https://openalex.org/W2088622619","https://openalex.org/W2089828587","https://openalex.org/W2092349993","https://openalex.org/W2100061495","https://openalex.org/W2102669784","https://openalex.org/W2149135074","https://openalex.org/W2158219072","https://openalex.org/W2989661724"],"related_works":["https://openalex.org/W2011106535","https://openalex.org/W1541068124","https://openalex.org/W1994598067","https://openalex.org/W2036758175","https://openalex.org/W2007715402","https://openalex.org/W2137594557","https://openalex.org/W1525123833","https://openalex.org/W2475816962","https://openalex.org/W2004524662","https://openalex.org/W2899261484"],"abstract_inverted_index":{"An":[0],"extremely":[1],"simple":[2],"distributed":[3],"randomized":[4],"algorithm":[5,40,66,75],"is":[6,25,34,41,76],"presented":[7],"which":[8],"with":[9,48],"high":[10],"probability":[11],"properly":[12],"edge":[13],"colors":[14],"a":[15,100],"given":[16,36],"graph":[17,31],"using":[18],"(1":[19],"+":[20],"\u03f5)\u0394":[21],"colors,":[22],"where":[23,86,103],"\u0394":[24,93],"the":[26,30,65,84],"maximum":[27],"degree":[28],"of":[29,63],"and":[32,91],"\u03f5":[33],"any":[35,60],"positive":[37,61],"constant.":[38],"The":[39,74],"very":[42],"fast.":[43],"In":[44],"particular,":[45],"for":[46],"graphs":[47],"sufficiently":[49],"large":[50],"vertex":[51],"degrees":[52],"(larger":[53],"than":[54,59],"polylog":[55],"n,":[56],"but":[57,79],"smaller":[58],"power":[62],"n),":[64],"requires":[67,88,105],"only":[68],"O(log":[69,92],"log":[70,94,95],"n)":[71,96],"communication":[72],"rounds.":[73],"inherently":[77],"distributed,":[78],"can":[80],"be":[81],"implemented":[82],"on":[83],"PRAM,":[85],"it":[87,104],"O(m\u0394)":[89,106],"processors":[90],"time,":[97],"or":[98],"in":[99],"sequential":[101],"setting,":[102],"time.":[107],"\u00a9":[108],"1997":[109],"John":[110],"Wiley":[111],"&":[112],"Sons,":[113],"Inc.":[114],"Random":[115],"Struct.":[116],"Alg.,":[117],"10,":[118],"385\u2013405":[119],"(1997)":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}