{"id":"https://openalex.org/W2019615222","doi":"https://doi.org/10.1016/0304-3975(89)90127-8","title":"On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs","display_name":"On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs","publication_year":1989,"publication_date":"1989-10-01","ids":{"openalex":"https://openalex.org/W2019615222","doi":"https://doi.org/10.1016/0304-3975(89)90127-8","mag":"2019615222"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(89)90127-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(89)90127-8","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/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, 581 83 Linkoping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, 581 83 Linkoping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082277472","display_name":"Andrzej Proskurowski","orcid":null},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrzej Proskurowski","raw_affiliation_strings":["Department of Computer and Information Science, University of Oregon, Eugene, Oregon 97403, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Oregon, Eugene, Oregon 97403, U.S.A","institution_ids":["https://openalex.org/I181233156"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.4793,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.61299034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"68","issue":"2","first_page":"155","last_page":"173"},"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.9994000196456909,"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.9987000226974487,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.9160650968551636},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.9065568447113037},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7389576435089111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7290822267532349},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5703848600387573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5056347846984863},{"id":"https://openalex.org/keywords/homeomorphism","display_name":"Homeomorphism (graph theory)","score":0.5000054836273193},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4450572431087494},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4431937336921692},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4183601438999176},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.37477999925613403},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26514604687690735},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2560896575450897},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16097265481948853}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.9160650968551636},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.9065568447113037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7389576435089111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7290822267532349},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5703848600387573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5056347846984863},{"id":"https://openalex.org/C10728891","wikidata":"https://www.wikidata.org/wiki/Q584521","display_name":"Homeomorphism (graph theory)","level":2,"score":0.5000054836273193},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4450572431087494},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4431937336921692},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4183601438999176},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.37477999925613403},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26514604687690735},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2560896575450897},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16097265481948853},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(89)90127-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(89)90127-8","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W108777047","https://openalex.org/W855674090","https://openalex.org/W1558316751","https://openalex.org/W1587831743","https://openalex.org/W1655990431","https://openalex.org/W1967575173","https://openalex.org/W1977119258","https://openalex.org/W1979641885","https://openalex.org/W1982180670","https://openalex.org/W1996419691","https://openalex.org/W2004350101","https://openalex.org/W2011039300","https://openalex.org/W2013444956","https://openalex.org/W2020556510","https://openalex.org/W2027501230","https://openalex.org/W2028121038","https://openalex.org/W2038599141","https://openalex.org/W2038674294","https://openalex.org/W2048838677","https://openalex.org/W2074456731","https://openalex.org/W2076318470","https://openalex.org/W2093092867","https://openalex.org/W2094122366","https://openalex.org/W2134008688","https://openalex.org/W2151646204","https://openalex.org/W2172037773","https://openalex.org/W2433940709","https://openalex.org/W2530747039","https://openalex.org/W2569646339","https://openalex.org/W6623616735","https://openalex.org/W6635179969","https://openalex.org/W6645220033","https://openalex.org/W6645334282","https://openalex.org/W6660161903","https://openalex.org/W6682700026"],"related_works":["https://openalex.org/W2032950096","https://openalex.org/W2906832313","https://openalex.org/W3021406511","https://openalex.org/W2169699292","https://openalex.org/W2953380283","https://openalex.org/W4302392472","https://openalex.org/W2019615222","https://openalex.org/W1544045550","https://openalex.org/W4292501833","https://openalex.org/W2167871506"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}