{"id":"https://openalex.org/W2122000012","doi":"https://doi.org/10.1017/s0963548306007644","title":"Randomized Algorithms for Determining the Majority on Graphs","display_name":"Randomized Algorithms for Determining the Majority on Graphs","publication_year":2006,"publication_date":"2006-08-14","ids":{"openalex":"https://openalex.org/W2122000012","doi":"https://doi.org/10.1017/s0963548306007644","mag":"2122000012"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548306007644","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007644","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5087104329","display_name":"Gianluca De Marco","orcid":"https://orcid.org/0000-0002-1204-0646"},"institutions":[{"id":"https://openalex.org/I4210130157","display_name":"Institute of Informatics and Telematics","ror":"https://ror.org/02gdcn153","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210130157","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"GIANLUCA DE MARCO","raw_affiliation_strings":["Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, via Moruzzi 1, 56124 Pisa, Italy (e-mail:","Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, via Moruzzi 1, 56124 Pisa, Italy (e-mail: gianluca.demarco@iit.cnr.it)#TAB#"],"affiliations":[{"raw_affiliation_string":"Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, via Moruzzi 1, 56124 Pisa, Italy (e-mail:","institution_ids":["https://openalex.org/I4210130157"]},{"raw_affiliation_string":"Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, via Moruzzi 1, 56124 Pisa, Italy (e-mail: gianluca.demarco@iit.cnr.it)#TAB#","institution_ids":["https://openalex.org/I4210130157"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102714160","display_name":"Andrzej Pelc","orcid":"https://orcid.org/0000-0003-0598-1218"},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"ANDRZEJ PELC","raw_affiliation_strings":["D\u00e9partement d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec J8X 3X7, Canada (e-mail:","D\u00e9partement d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec J8X 3X7, Canada (e-mail: andrzej.pelc@uqo.ca)#TAB#"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec J8X 3X7, Canada (e-mail:","institution_ids":["https://openalex.org/I33217400"]},{"raw_affiliation_string":"D\u00e9partement d'informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec J8X 3X7, Canada (e-mail: andrzej.pelc@uqo.ca)#TAB#","institution_ids":["https://openalex.org/I33217400"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087104329"],"corresponding_institution_ids":["https://openalex.org/I4210130157"],"apc_list":null,"apc_paid":null,"fwci":0.9811,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.77078881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":"6","first_page":"823","last_page":"834"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T10829","display_name":"Interconnection Networks and Systems","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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6068845987319946},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5561180114746094},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5410493612289429},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5406955480575562},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5294577479362488},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5094571709632874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5081336498260498},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.476124107837677},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47298964858055115},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46366360783576965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4560830295085907},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35111984610557556},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34882664680480957}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6068845987319946},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5561180114746094},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5410493612289429},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5406955480575562},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5294577479362488},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5094571709632874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5081336498260498},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.476124107837677},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47298964858055115},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46366360783576965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4560830295085907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35111984610557556},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34882664680480957},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548306007644","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007644","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971578319","https://openalex.org/W1975092363","https://openalex.org/W2023146810","https://openalex.org/W2023626992","https://openalex.org/W2037529689","https://openalex.org/W2041211631","https://openalex.org/W2057399436","https://openalex.org/W2061534693","https://openalex.org/W2072153301","https://openalex.org/W2086934045","https://openalex.org/W2139964991","https://openalex.org/W2913576431"],"related_works":["https://openalex.org/W4360764540","https://openalex.org/W4231657010","https://openalex.org/W4321472505","https://openalex.org/W2395986200","https://openalex.org/W1994552539","https://openalex.org/W2007917622","https://openalex.org/W2385305544","https://openalex.org/W1985852812","https://openalex.org/W2041927040","https://openalex.org/W1994341438"],"abstract_inverted_index":{"Every":[0],"node":[1,38],"of":[2,20,39,52],"an":[3],"undirected":[4],"connected":[5],"graph":[6],"is":[7,23,34,48],"coloured":[8],"white":[9,55],"or":[10,28,43],"black.":[11],"Adjacent":[12],"nodes":[13],"can":[14],"be":[15,92],"compared":[16],"and":[17,54,64,67,85],"the":[18,40,49],"outcome":[19],"each":[21],"comparison":[22],"either":[24],"0":[25],"(same":[26],"colour)":[27],"1":[29],"(different":[30],"colours).":[31],"The":[32],"aim":[33],"to":[35,44],"discover":[36],"a":[37],"majority":[41],"colour,":[42],"conclude":[45],"that":[46,82],"there":[47],"same":[50],"number":[51],"black":[53],"nodes.":[56],"We":[57],"consider":[58],"randomized":[59],"algorithms":[60,87],"for":[61,88],"this":[62,89],"task":[63],"establish":[65],"upper":[66],"lower":[68,79],"bounds":[69,80],"on":[70],"their":[71],"expected":[72],"running":[73],"time.":[74],"Our":[75],"main":[76],"contribution":[77],"are":[78],"showing":[81],"some":[83],"simple":[84],"natural":[86],"problem":[90],"cannot":[91],"improved":[93],"in":[94],"general.":[95]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}