{"id":"https://openalex.org/W2069194665","doi":"https://doi.org/10.1016/0020-0190(96)00040-3","title":"A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity","display_name":"A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity","publication_year":1996,"publication_date":"1996-04-01","ids":{"openalex":"https://openalex.org/W2069194665","doi":"https://doi.org/10.1016/0020-0190(96)00040-3","mag":"2069194665"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(96)00040-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00040-3","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/A5000690869","display_name":"Oscar Garrido","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Oscar Garrido","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden","Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047369180","display_name":"Pierre Kelsen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pierre Kelsen","raw_affiliation_strings":["Max-Plank-Institut f\u00fcr Informatik, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Plank-Institut f\u00fcr Informatik, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden","Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016509031"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.19952581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"58","issue":"2","first_page":"55","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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.9988999962806702,"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/arboricity","display_name":"Arboricity","score":0.8742188811302185},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7972162961959839},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7101766467094421},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5895915031433105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5472102761268616},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4819047749042511},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4776019752025604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4352063536643982},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3547621965408325},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14820542931556702}],"concepts":[{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.8742188811302185},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7972162961959839},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7101766467094421},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5895915031433105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5472102761268616},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4819047749042511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4776019752025604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4352063536643982},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3547621965408325},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14820542931556702},{"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/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(96)00040-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00040-3","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":19,"referenced_works":["https://openalex.org/W190838824","https://openalex.org/W1530753374","https://openalex.org/W1531368347","https://openalex.org/W1584086289","https://openalex.org/W1993388844","https://openalex.org/W1997802297","https://openalex.org/W2005390858","https://openalex.org/W2068040398","https://openalex.org/W2071134069","https://openalex.org/W2095163132","https://openalex.org/W2100061495","https://openalex.org/W2118288908","https://openalex.org/W2132750992","https://openalex.org/W2169102947","https://openalex.org/W2395933225","https://openalex.org/W6634962901","https://openalex.org/W6643537620","https://openalex.org/W6656615758","https://openalex.org/W6674408939"],"related_works":["https://openalex.org/W1973112719","https://openalex.org/W2610603795","https://openalex.org/W2094188431","https://openalex.org/W1975580069","https://openalex.org/W3094179932","https://openalex.org/W3040943902","https://openalex.org/W3005801850","https://openalex.org/W2950595062","https://openalex.org/W2352105239","https://openalex.org/W3097603206"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}