{"id":"https://openalex.org/W2155031674","doi":"https://doi.org/10.1145/1741906.1742013","title":"Randomized distributed algorithm for vertex coloring","display_name":"Randomized distributed algorithm for vertex coloring","publication_year":2010,"publication_date":"2010-02-26","ids":{"openalex":"https://openalex.org/W2155031674","doi":"https://doi.org/10.1145/1741906.1742013","mag":"2155031674"},"language":"en","primary_location":{"id":"doi:10.1145/1741906.1742013","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1741906.1742013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference and Workshop on Emerging Trends in Technology","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/A5113297028","display_name":"S. Choudhary","orcid":null},"institutions":[{"id":"https://openalex.org/I102117144","display_name":"Banasthali University","ror":"https://ror.org/05ycegt40","country_code":"IN","type":"education","lineage":["https://openalex.org/I102117144"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S. Choudhary","raw_affiliation_strings":["Banasthali University, C-Scheme, Jaipur"],"affiliations":[{"raw_affiliation_string":"Banasthali University, C-Scheme, Jaipur","institution_ids":["https://openalex.org/I102117144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035953110","display_name":"G. N. Purohit","orcid":"https://orcid.org/0000-0002-7214-4500"},"institutions":[{"id":"https://openalex.org/I102117144","display_name":"Banasthali University","ror":"https://ror.org/05ycegt40","country_code":"IN","type":"education","lineage":["https://openalex.org/I102117144"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G. N. Purohit","raw_affiliation_strings":["Banasthali University, C-Scheme, Jaipur"],"affiliations":[{"raw_affiliation_string":"Banasthali University, C-Scheme, Jaipur","institution_ids":["https://openalex.org/I102117144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113297028"],"corresponding_institution_ids":["https://openalex.org/I102117144"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18042115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3121","issue":null,"first_page":"477","last_page":"480"},"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.9995999932289124,"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.9995999932289124,"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.9980999827384949,"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.992900013923645,"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","display_name":"Vertex (graph theory)","score":0.7264906167984009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6504302024841309},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5343310832977295},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5016212463378906},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.47314131259918213},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.44779208302497864},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.43249309062957764},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4217255413532257},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.41237854957580566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3250690996646881},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3005087971687317},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2650684118270874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24481233954429626},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.17285320162773132},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.06076294183731079}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7264906167984009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6504302024841309},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5343310832977295},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5016212463378906},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.47314131259918213},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.44779208302497864},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43249309062957764},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4217255413532257},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.41237854957580566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3250690996646881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3005087971687317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2650684118270874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24481233954429626},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.17285320162773132},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.06076294183731079},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1741906.1742013","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1741906.1742013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference and Workshop on Emerging Trends in Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1905972793","https://openalex.org/W1964089073","https://openalex.org/W1992766498","https://openalex.org/W1997707549","https://openalex.org/W1998137177","https://openalex.org/W2022143201","https://openalex.org/W2026143151","https://openalex.org/W2034499376","https://openalex.org/W2054910423","https://openalex.org/W2071114738","https://openalex.org/W2081776945","https://openalex.org/W2090222354","https://openalex.org/W2103345353","https://openalex.org/W2109368894","https://openalex.org/W2151757686","https://openalex.org/W2154189866","https://openalex.org/W2170161043","https://openalex.org/W2335155080","https://openalex.org/W6703291379"],"related_works":["https://openalex.org/W3003449463","https://openalex.org/W2963989216","https://openalex.org/W2804969619","https://openalex.org/W4301100693","https://openalex.org/W2964258819","https://openalex.org/W2951429970","https://openalex.org/W2145212918","https://openalex.org/W2574748442","https://openalex.org/W2742166337","https://openalex.org/W4396856370"],"abstract_inverted_index":{"Many":[0],"computational":[1],"tasks":[2],"require":[3],"the":[4,10],"cooperation":[5],"of":[6,39,59],"many":[7],"processors":[8,15],"in":[9,31],"network,":[11],"but":[12],"prohibit":[13],"certain":[14],"pair":[16],"(or":[17],"large":[18],"group)":[19],"from":[20],"operating":[21],"simultaneously.":[22],"This":[23],"symmetry":[24,36],"breaking":[25,37],"technique":[26],"play":[27],"a":[28],"major":[29],"role":[30],"distributed":[32,64],"network":[33],"algorithm.":[34],"Two":[35],"task":[38],"\"localized\"":[40],"nature":[41],"are":[42],"coloring":[43,68],"(Vertex":[44],"Coloring)":[45],"and":[46,61],"Maximal":[47],"Independence":[48],"Set":[49],"(MIS).":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"present":[55],"an":[56],"experimental":[57],"analysis":[58],"simple":[60],"elegant":[62],"randomized":[63],"algorithm":[65],"for":[66],"vertex":[67],"problem":[69]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}