{"id":"https://openalex.org/W2599155613","doi":"https://doi.org/10.1007/s00446-017-0298-y","title":"Computing large independent sets in a single round","display_name":"Computing large independent sets in a single round","publication_year":2017,"publication_date":"2017-03-24","ids":{"openalex":"https://openalex.org/W2599155613","doi":"https://doi.org/10.1007/s00446-017-0298-y","mag":"2599155613"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-017-0298-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-017-0298-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00446-017-0298-y.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00446-017-0298-y.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019056248","display_name":"Magn\u00fas M. Halld\u00f3rsson","orcid":"https://orcid.org/0000-0002-5774-8437"},"institutions":[{"id":"https://openalex.org/I123185442","display_name":"Reykjav\u00edk University","ror":"https://ror.org/05d2kyx68","country_code":"IS","type":"education","lineage":["https://openalex.org/I123185442"]}],"countries":["IS"],"is_corresponding":false,"raw_author_name":"Magn\u00fas M. Halld\u00f3rsson","raw_affiliation_strings":["ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, 101, Reykjavik, Iceland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, 101, Reykjavik, Iceland","institution_ids":["https://openalex.org/I123185442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054336577","display_name":"Christian Konrad","orcid":"https://orcid.org/0000-0003-1802-4011"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Christian Konrad","raw_affiliation_strings":["Department of Computer Science, Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, UK"],"raw_orcid":"https://orcid.org/0000-0003-1802-4011","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054336577"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2490,"currency":"EUR","value_usd":3090},"fwci":0.948,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76645725,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"1","first_page":"69","last_page":"82"},"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.9998000264167786,"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.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/sublinear-function","display_name":"Sublinear function","score":0.8101011514663696},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7224591374397278},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6778750419616699},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6284940242767334},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.59528648853302},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5801197290420532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.538855254650116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5384234189987183},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5075360536575317},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5013642311096191},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.49706676602363586},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4861854910850525},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.44441524147987366},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.43052491545677185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32857823371887207},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.32186245918273926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20765671133995056},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17945381999015808},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12164387106895447}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8101011514663696},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7224591374397278},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6778750419616699},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6284940242767334},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.59528648853302},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5801197290420532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.538855254650116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5384234189987183},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5075360536575317},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5013642311096191},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.49706676602363586},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4861854910850525},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.44441524147987366},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.43052491545677185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32857823371887207},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.32186245918273926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20765671133995056},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17945381999015808},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12164387106895447},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":3,"locations":[{"id":"doi:10.1007/s00446-017-0298-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-017-0298-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00446-017-0298-y.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/de4d7937-6500-4f75-88ca-fddd326b61f7","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/de4d7937-6500-4f75-88ca-fddd326b61f7","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Halld\u00f3rsson, M M & Konrad, C 2018, 'Computing large independent sets in a single round', Distributed Computing, vol. 31, no. 1, pp. 69-82. https://doi.org/10.1007/s00446-017-0298-y","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/de4d7937-6500-4f75-88ca-fddd326b61f7","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/de4d7937-6500-4f75-88ca-fddd326b61f7","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1007/s00446-017-0298-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-017-0298-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00446-017-0298-y.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2671538047","display_name":null,"funder_award_id":"120032011","funder_id":"https://openalex.org/F4320321020","funder_display_name":"Icelandic Centre for Research"},{"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/G6316709793","display_name":null,"funder_award_id":"152679-051","funder_id":"https://openalex.org/F4320321020","funder_display_name":"Icelandic Centre for Research"},{"id":"https://openalex.org/G8657054497","display_name":"Sublinear Algorithms for Big Graphs","funder_award_id":"EP/N011163/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320279","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86"},{"id":"https://openalex.org/F4320321020","display_name":"Icelandic Centre for Research","ror":"https://ror.org/03srneg48"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2599155613.pdf","grobid_xml":"https://content.openalex.org/works/W2599155613.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W1430039862","https://openalex.org/W1501644705","https://openalex.org/W1547533890","https://openalex.org/W1666479227","https://openalex.org/W1750839748","https://openalex.org/W1869515244","https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1968191405","https://openalex.org/W1980501142","https://openalex.org/W1998643836","https://openalex.org/W2017345786","https://openalex.org/W2054910423","https://openalex.org/W2065248207","https://openalex.org/W2068871408","https://openalex.org/W2081254453","https://openalex.org/W2083187124","https://openalex.org/W2100061495","https://openalex.org/W2102334337","https://openalex.org/W2109368894","https://openalex.org/W2136749024","https://openalex.org/W2138623498","https://openalex.org/W2147408677","https://openalex.org/W2152723361","https://openalex.org/W2162846859","https://openalex.org/W2169324896","https://openalex.org/W2186715137","https://openalex.org/W2229908240","https://openalex.org/W2401610261","https://openalex.org/W2402203281","https://openalex.org/W2487418934","https://openalex.org/W2503706701","https://openalex.org/W2568091325","https://openalex.org/W2571153928","https://openalex.org/W2594917573","https://openalex.org/W2610183793","https://openalex.org/W2953390354","https://openalex.org/W2963181990","https://openalex.org/W3140173745"],"related_works":["https://openalex.org/W4376639521","https://openalex.org/W2103112216","https://openalex.org/W3030122542","https://openalex.org/W4283803822","https://openalex.org/W2029336174","https://openalex.org/W1968027460","https://openalex.org/W1492613353","https://openalex.org/W1608132493","https://openalex.org/W1811247372","https://openalex.org/W2007607373"],"abstract_inverted_index":{"Independent":[0],"sets":[1],"play":[2],"a":[3,29,40,50,78,115,124,134,141,145,176,183],"central":[4],"role":[5],"in":[6,28,58,69,110,140,182],"distributed":[7],"algorithmics.":[8],"We":[9,54,158,198],"examine":[10],"here":[11],"the":[12,59,62,72,95,98,104,120,149,152,167,205,216],"minimal":[13,168],"requirements":[14,169],"for":[15,107,170],"computing":[16],"non-trivial":[17,172],"independent":[18,52,108],"sets.":[19],"In":[20,174],"particular,":[21,175],"we":[22,92],"focus":[23],"on":[24,86,127,186,208],"algorithms":[25],"that":[26,39,64,82,94,119,162,164,201,215],"operate":[27],"single":[30,135,184],"communication":[31],"round.":[32],"A":[33],"classic":[34],"result":[35,76],"of":[36,43,61,88,103,151,204],"Linial":[37],"shows":[38],"constant":[41,116],"number":[42],"rounds":[44],"does":[45,220],"not":[46,221],"suffice":[47],"to":[48,71,114,223],"compute":[49],"maximal":[51],"set.":[53],"are":[55,166],"therefore":[56],"interested":[57],"size":[60],"solution":[63],"can":[65],"be":[66,180],"computed,":[67],"especially":[68],"comparison":[70],"optimal.":[73],"Our":[74],"main":[75],"is":[77,212],"randomized":[79],"one-round":[80],"algorithm":[81,96,131],"achieves":[83,97],"poly-logarithmic":[84,125,217],"approximation":[85,126,178,218],"graphs":[87,112,211],"polynomially":[89,209],"bounded-independence.":[90],"Specifically,":[91],"show":[93,163,200],"Caro-Wei":[99,121,206],"bound":[100,106,122,207],"(an":[101],"extension":[102],"Tur\u00e1n":[105],"sets)":[109],"general":[111,187],"up":[113],"factor,":[117],"and":[118,138,195,214],"yields":[123],"bounded-independence":[128,210],"graphs.":[129,228],"The":[130],"uses":[132],"only":[133,148],"bit":[136],"message":[137],"operates":[139],"beeping":[142],"model,":[143],"where":[144],"node":[146],"receives":[147],"disjunction":[150],"bits":[153],"transmitted":[154],"by":[155],"its":[156],"neighbors.":[157],"give":[159],"limitation":[160],"results":[161],"these":[165],"obtaining":[171],"solutions.":[173],"sublinear":[177],"cannot":[179,192],"obtained":[181],"round":[185],"graphs,":[188],"nor":[189],"when":[190],"nodes":[191],"both":[193],"transmit":[194],"receive":[196],"messages.":[197],"also":[199],"our":[202],"analysis":[203],"tight,":[213],"factor":[219],"extend":[222],"$$\\mathrm":[224],"{O}(1)$$":[225],"-claw":[226],"free":[227]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}