{"id":"https://openalex.org/W1992702935","doi":"https://doi.org/10.1016/0304-3975(88)90106-5","title":"A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs","display_name":"A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs","publication_year":1988,"publication_date":"1988-10-01","ids":{"openalex":"https://openalex.org/W1992702935","doi":"https://doi.org/10.1016/0304-3975(88)90106-5","mag":"1992702935"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(88)90106-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90106-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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/A5074983702","display_name":"Xin He","orcid":"https://orcid.org/0000-0002-3904-0478"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xin He","raw_affiliation_strings":["Department of Computer and Information Science, Ohio State University, Columbus, OH 4010 U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Ohio State University, Columbus, OH 4010 U.S.A","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074983702"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.0602,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7334252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"61","issue":"1","first_page":"33","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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/algorithm","display_name":"Algorithm","score":0.5689406991004944},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5562713146209717},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5334491729736328},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5020313262939453},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.48898160457611084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4741622507572174},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4642179012298584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4240318238735199},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3718554377555847},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3550482392311096},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.26548492908477783},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23732969164848328},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0658501386642456}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5689406991004944},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5562713146209717},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5334491729736328},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5020313262939453},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.48898160457611084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4741622507572174},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4642179012298584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4240318238735199},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3718554377555847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3550482392311096},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.26548492908477783},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23732969164848328},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0658501386642456},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(88)90106-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90106-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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":21,"referenced_works":["https://openalex.org/W1964089073","https://openalex.org/W1995040285","https://openalex.org/W2004350101","https://openalex.org/W2013444956","https://openalex.org/W2017205387","https://openalex.org/W2033177550","https://openalex.org/W2038599141","https://openalex.org/W2049413646","https://openalex.org/W2060537627","https://openalex.org/W2071134069","https://openalex.org/W2084593768","https://openalex.org/W2100061495","https://openalex.org/W2126876121","https://openalex.org/W2134008688","https://openalex.org/W2148686552","https://openalex.org/W3145802425","https://openalex.org/W6645220033","https://openalex.org/W6656615758","https://openalex.org/W6658506697","https://openalex.org/W6660161903","https://openalex.org/W6681723955"],"related_works":["https://openalex.org/W3216105633","https://openalex.org/W1701875187","https://openalex.org/W2990956612","https://openalex.org/W4283803822","https://openalex.org/W2029336174","https://openalex.org/W2963009577","https://openalex.org/W2063494850","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W3199257895"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}