{"id":"https://openalex.org/W2071114738","doi":"https://doi.org/10.1145/22145.22146","title":"A simple parallel algorithm for the maximal independent set problem","display_name":"A simple parallel algorithm for the maximal independent set problem","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2071114738","doi":"https://doi.org/10.1145/22145.22146","mag":"2071114738"},"language":"en","primary_location":{"id":"doi:10.1145/22145.22146","doi":"https://doi.org/10.1145/22145.22146","is_oa":true,"landing_page_url":"https://doi.org/10.1145/22145.22146","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/22145.22146","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/22145.22146","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079654174","display_name":"Michael G. Luby","orcid":"https://orcid.org/0000-0002-6239-8072","observed_orcids":["https://orcid.org/0000-0002-6239-8072"]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"M Luby","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4","Dept. of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Toronto, Toronto, Canada, M5S 1A4#TAB#","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079654174"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":8.9784,"has_fulltext":true,"cited_by_count":392,"citation_normalized_percentile":{"value":0.98839907,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9746000170707703,"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.9746000170707703,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.00930000003427267,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.00279999990016222,"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/maximal-independent-sets","display_name":"maximal independent sets","score":0.9139999747276306},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9959999918937683},{"id":"https://openalex.org/keywords/monte-carlo-methods","display_name":"Monte Carlo methods","score":0.9919999837875366},{"id":"https://openalex.org/keywords/deterministic-algorithms","display_name":"deterministic algorithms","score":0.7670000195503235},{"id":"https://openalex.org/keywords/local-algorithms","display_name":"local algorithms","score":0.5669999718666077}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7370527982711792},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.7086939811706543},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6846380233764648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6845911145210266},{"id":"https://openalex.org/C15482360","wikidata":"https://www.wikidata.org/wiki/Q15238499","display_name":"Monte Carlo algorithm","level":3,"score":0.5702142715454102},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5323750376701355},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.5215327739715576},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4373198449611664},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.43452197313308716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19224756956100464},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/22145.22146","doi":"https://doi.org/10.1145/22145.22146","is_oa":true,"landing_page_url":"https://doi.org/10.1145/22145.22146","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/22145.22146","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.5475","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.5475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://disco.ethz.ch/members/pascal/refs/mis_1986_luby.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/22145.22146","doi":"https://doi.org/10.1145/22145.22146","is_oa":true,"landing_page_url":"https://doi.org/10.1145/22145.22146","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/22145.22146","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2071114738.pdf","grobid_xml":"https://content.openalex.org/works/W2071114738.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W30844683","https://openalex.org/W1603112539","https://openalex.org/W1964089073","https://openalex.org/W1970016373","https://openalex.org/W2017205387","https://openalex.org/W2071134069","https://openalex.org/W2100061495","https://openalex.org/W2118547397","https://openalex.org/W2128084896","https://openalex.org/W2131798840","https://openalex.org/W2141420453","https://openalex.org/W2751862591","https://openalex.org/W4240907844"],"related_works":["https://openalex.org/W2153746396","https://openalex.org/W7098318217","https://openalex.org/W3113653433","https://openalex.org/W3134131990","https://openalex.org/W7095886079","https://openalex.org/W6922181371","https://openalex.org/W2953390354","https://openalex.org/W1964089073","https://openalex.org/W7098947976","https://openalex.org/W2071134069"],"abstract_inverted_index":{"Simple":[0],"parallel":[1,92],"algorithms":[2,66],"for":[3,62,80],"the":[4,48,55,76,81,90],"maximal":[5],"independent":[6],"set":[7],"(MIS)":[8],"problem":[9,83],"are":[10,72],"presented.":[11],"The":[12,25],"first":[13],"algorithm":[14,19,30,79,88],"is":[15,54],"a":[16,21,34,85],"Monte":[17,64,77],"Carlo":[18,65,78],"with":[20,89],"very":[22],"local":[23,26],"property.":[24],"property":[27],"of":[28,47,51,57],"this":[29,52],"may":[31],"make":[32],"it":[33],"useful":[35],"protocol":[36],"design":[37],"tool":[38],"in":[39],"distributed":[40],"computing":[41],"environments":[42],"and":[43,59],"artificial":[44],"intelligence.":[45],"One":[46],"main":[49],"contributions":[50],"paper":[53],"development":[56],"powerful":[58],"general":[60],"techniques":[61,71],"converting":[63],"into":[67,84],"deterministic":[68,87],"algorithms.":[69],"These":[70],"used":[73],"to":[74],"convert":[75],"MIS":[82],"simple":[86],"same":[91],"running":[93],"time.":[94]},"counts_by_year":[{"year":2026,"cited_by_count":16},{"year":2025,"cited_by_count":32},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":17}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}