{"id":"https://openalex.org/W2083187124","doi":"https://doi.org/10.1137/0406036","title":"An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size","display_name":"An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size","publication_year":1993,"publication_date":"1993-08-01","ids":{"openalex":"https://openalex.org/W2083187124","doi":"https://doi.org/10.1137/0406036","mag":"2083187124"},"language":"en","primary_location":{"id":"doi:10.1137/0406036","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0406036","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":0.0,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.22264285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"3","first_page":"443","last_page":"459"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7701507806777954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7650473117828369},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6560148596763611},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5710325241088867},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5669209361076355},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5123351812362671},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4390954375267029},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43466776609420776},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42430388927459717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14809784293174744}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7701507806777954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7650473117828369},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6560148596763611},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5710325241088867},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5669209361076355},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5123351812362671},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4390954375267029},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43466776609420776},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42430388927459717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14809784293174744},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0406036","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0406036","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"}],"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/W947400629","https://openalex.org/W1964089073","https://openalex.org/W1993297915","https://openalex.org/W1995040285","https://openalex.org/W1997802297","https://openalex.org/W2040924621","https://openalex.org/W2081385108","https://openalex.org/W2100061495","https://openalex.org/W2110963759","https://openalex.org/W2130566259","https://openalex.org/W2143462372","https://openalex.org/W3084987570"],"related_works":["https://openalex.org/W3173705736","https://openalex.org/W2374778222","https://openalex.org/W4284991794","https://openalex.org/W2964109715","https://openalex.org/W4308003424","https://openalex.org/W4367680209","https://openalex.org/W4300382303","https://openalex.org/W2952236409","https://openalex.org/W1979223578","https://openalex.org/W4297943471"],"abstract_inverted_index":{"Every":[0],"graph":[1],"with":[2,47,88],"n":[3,40],"vertices":[4],"and":[5,35],"m":[6,50],"edges":[7],"has":[8],"an":[9,29,85],"independent":[10,30],"set":[11,31],"containing":[12],"at":[13],"least":[14],"$n^2":[15],"/":[16],"(2m":[17],"+":[18,51],"n)$":[19,57],"vertices.":[20],"This":[21],"paper":[22],"presents":[23],"a":[24,44,65,93],"parallel":[25],"algorithm":[26,79,86],"that":[27],"finds":[28,92],"of":[32,68,77],"this":[33,78],"size":[34],"runs":[36],"in":[37,74],"$O(":[38,48],"\\log^3":[39],")$":[41,63],"time":[42],"on":[43],"CROW":[45],"PRAM":[46],"(":[49,53,61],"n)\\alpha":[52],"m,n":[54],")/":[55],"\\log^2":[56],"processors,":[58],"where":[59],"$\\alpha":[60],"n,m":[62],"is":[64],"functional":[66],"inverse":[67],"Ackerman\u2019s":[69],"function.":[70],"The":[71],"ideas":[72],"used":[73,82],"the":[75,89],"design":[76,84],"are":[80],"also":[81],"to":[83],"that,":[87],"same":[90],"resources,":[91],"vertex":[94],"coloring":[95],"satisfying":[96],"certain":[97],"minimality":[98],"conditions.":[99]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}