{"id":"https://openalex.org/W1997802297","doi":"https://doi.org/10.1137/0402028","title":"Constructing a Maximal Independent Set in Parallel","display_name":"Constructing a Maximal Independent Set in Parallel","publication_year":1989,"publication_date":"1989-08-01","ids":{"openalex":"https://openalex.org/W1997802297","doi":"https://doi.org/10.1137/0402028","mag":"1997802297"},"language":"en","primary_location":{"id":"doi:10.1137/0402028","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0402028","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5104492185","display_name":"Mark Goldberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mark Goldberg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029058636","display_name":"Thomas H. Spencer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Spencer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104492185"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8705,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.90848278,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"2","issue":"3","first_page":"322","last_page":"328"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9991999864578247,"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/combinatorics","display_name":"Combinatorics","score":0.6861922740936279},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6508054137229919},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6507624983787537},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5287463665008545},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5246886610984802},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5058593153953552},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48968151211738586},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4891974925994873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47368764877319336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4626162350177765},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4461612403392792},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3419467806816101},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25647082924842834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24915024638175964},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.13479626178741455},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.09574732184410095}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6861922740936279},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6508054137229919},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6507624983787537},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5287463665008545},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5246886610984802},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5058593153953552},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48968151211738586},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4891974925994873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47368764877319336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4626162350177765},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4461612403392792},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3419467806816101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25647082924842834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24915024638175964},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.13479626178741455},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.09574732184410095},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0402028","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0402028","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.432","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rpi.edu/~goldberg/publications/ind-1.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.1151","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.1151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rpi.edu/~goldberg/publications/ind-1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W947400629","https://openalex.org/W1484040084","https://openalex.org/W1587590810","https://openalex.org/W1964089073","https://openalex.org/W1979641885","https://openalex.org/W2013444956","https://openalex.org/W2071134069","https://openalex.org/W2100061495","https://openalex.org/W2110963759","https://openalex.org/W2118288908","https://openalex.org/W2132750992","https://openalex.org/W2134008688","https://openalex.org/W2149410722"],"related_works":["https://openalex.org/W2018076478","https://openalex.org/W1945279274","https://openalex.org/W1992470151","https://openalex.org/W2005608544","https://openalex.org/W1974100545","https://openalex.org/W2072442084","https://openalex.org/W2066015450","https://openalex.org/W1994598067","https://openalex.org/W2039351412","https://openalex.org/W2407321536"],"abstract_inverted_index":{"The":[0],"problem":[1,74],"of":[2,10,54,65,79],"constructing":[3],"in":[4,21,45],"parallel":[5],"a":[6,11,52,76],"maximal":[7],"independent":[8],"set":[9],"given":[12],"graph":[13],"is":[14,26],"considered.":[15],"A":[16],"new":[17],"deterministic":[18,69],"NC-algorithm":[19],"implemented":[20],"the":[22,58,62,66,73],"EREW":[23],"PRAM":[24],"model":[25],"presented.":[27],"On":[28],"graphs":[29],"with":[30],"n":[31],"vertices":[32],"and":[33,43,61],"m":[34],"edges,":[35],"it":[36],"uses":[37],"$O((n":[38],"+":[39],"m)/\\log":[40],"n)$":[41,47],"processors":[42],"runs":[44],"$O(\\log^3":[46],"time.":[48],"This":[49],"reduces":[50],"by":[51],"factor":[53],"$\\log":[55],"n$":[56],"both":[57],"running":[59],"time":[60],"processor":[63],"count":[64],"previously":[67],"fastest":[68],"algorithm":[70],"that":[71],"solves":[72],"using":[75],"linear":[77],"number":[78],"processors.":[80]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":21},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}