{"id":"https://openalex.org/W2068040398","doi":"https://doi.org/10.1016/0020-0190(92)90228-n","title":"An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3","display_name":"An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3","publication_year":1992,"publication_date":"1992-07-01","ids":{"openalex":"https://openalex.org/W2068040398","doi":"https://doi.org/10.1016/0020-0190(92)90228-n","mag":"2068040398"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(92)90228-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90228-n","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5065666747","display_name":"Elias Dahlhaus","orcid":"https://orcid.org/0000-0001-8094-4383"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Elias Dahlhaus","raw_affiliation_strings":["Department of Computer Science, University of Bonn, Bonn, Germany","Dept. of Comput. Sci., Univ. of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]},{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["Department of Computer Science, University of Bonn, Bonn, Germany","International Computer Science Institute, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"International Computer Science Institute, Berkeley, CA, USA","institution_ids":["https://openalex.org/I1297971548"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047369180","display_name":"Pierre Kelsen","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pierre Kelsen","raw_affiliation_strings":["Department of Computer Sciences, University of Texas, Austin TX 78712, USA","Dept. of Computer Sciences, Univ. of Texas, Austin, TX 78712, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas, Austin TX 78712, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Computer Sciences, Univ. of Texas, Austin, TX 78712, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047369180"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.439,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.82273603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"42","issue":"6","first_page":"309","last_page":"313"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/hypergraph","display_name":"Hypergraph","score":0.9699983596801758},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.7213839292526245},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5657901167869568},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.556962788105011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5558943748474121},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5447661280632019},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46367666125297546},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44566643238067627},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.42876237630844116},{"id":"https://openalex.org/keywords/vc-dimension","display_name":"VC dimension","score":0.42384272813796997},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4145898222923279},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3701429069042206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2995898723602295}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9699983596801758},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.7213839292526245},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5657901167869568},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.556962788105011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5558943748474121},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5447661280632019},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46367666125297546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44566643238067627},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.42876237630844116},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.42384272813796997},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4145898222923279},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3701429069042206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2995898723602295},{"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.1016/0020-0190(92)90228-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(92)90228-n","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1964089073","https://openalex.org/W1976287818","https://openalex.org/W1997802297","https://openalex.org/W2005390858","https://openalex.org/W2078003433","https://openalex.org/W2095163132","https://openalex.org/W2100061495","https://openalex.org/W2110963759","https://openalex.org/W2274152967","https://openalex.org/W2395933225","https://openalex.org/W4236195087","https://openalex.org/W6634962901","https://openalex.org/W6643965769","https://openalex.org/W6674408939","https://openalex.org/W6694188180"],"related_works":["https://openalex.org/W1998397199","https://openalex.org/W2949537674","https://openalex.org/W4287657153","https://openalex.org/W3090976214","https://openalex.org/W2912545735","https://openalex.org/W2068040398","https://openalex.org/W2040170747","https://openalex.org/W2920461028","https://openalex.org/W4296268437","https://openalex.org/W2728331574"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}