{"id":"https://openalex.org/W2036621153","doi":"https://doi.org/10.1016/j.jda.2008.10.003","title":"An exact algorithm for subgraph homeomorphism","display_name":"An exact algorithm for subgraph homeomorphism","publication_year":2008,"publication_date":"2008-10-29","ids":{"openalex":"https://openalex.org/W2036621153","doi":"https://doi.org/10.1016/j.jda.2008.10.003","mag":"2036621153"},"language":"en","primary_location":{"id":"doi:10.1016/j.jda.2008.10.003","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jda.2008.10.003","pdf_url":null,"source":{"id":"https://openalex.org/S163424111","display_name":"Journal of Discrete Algorithms","issn_l":"1570-8667","issn":["1570-8667","1570-8675"],"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":"Journal of Discrete Algorithms","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/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":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden","Department of Computer Science, Lund University, Box 118, S-22100, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-22100, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034205918","display_name":"Martin Wahl\u00e9n","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":true,"raw_author_name":"Martin Wahlen","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden","Department of Computer Science, Lund University, Box 118, S-22100, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, S-22100, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034205918"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":0.4129,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.6706654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":"4","first_page":"464","last_page":"468"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7738274335861206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6980541348457336},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6421471834182739},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.558243989944458},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5030876994132996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48112598061561584},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4780481457710266},{"id":"https://openalex.org/keywords/homeomorphism","display_name":"Homeomorphism (graph theory)","score":0.4449802041053772},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.4193841218948364},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.31989628076553345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3124912977218628},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2378019392490387},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.16643589735031128}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7738274335861206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6980541348457336},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6421471834182739},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.558243989944458},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5030876994132996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48112598061561584},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4780481457710266},{"id":"https://openalex.org/C10728891","wikidata":"https://www.wikidata.org/wiki/Q584521","display_name":"Homeomorphism (graph theory)","level":2,"score":0.4449802041053772},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.4193841218948364},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.31989628076553345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3124912977218628},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2378019392490387},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.16643589735031128},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.jda.2008.10.003","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jda.2008.10.003","pdf_url":null,"source":{"id":"https://openalex.org/S163424111","display_name":"Journal of Discrete Algorithms","issn_l":"1570-8667","issn":["1570-8667","1570-8675"],"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":"Journal of Discrete Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:16652601-8838-4a2d-8a6a-193ec8d91c62","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/1670334","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1570-8667","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1969186119","https://openalex.org/W1975587904","https://openalex.org/W2001868457","https://openalex.org/W2002425091","https://openalex.org/W2005079828","https://openalex.org/W2011039300","https://openalex.org/W2045326192","https://openalex.org/W2073919081","https://openalex.org/W2076043677","https://openalex.org/W2083368929","https://openalex.org/W2094337274","https://openalex.org/W2099474653","https://openalex.org/W2102199027","https://openalex.org/W2163938320","https://openalex.org/W2170835539","https://openalex.org/W2476096155","https://openalex.org/W4251769540","https://openalex.org/W6642558617"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W3208942821","https://openalex.org/W2953496651","https://openalex.org/W1512756268","https://openalex.org/W2886672068","https://openalex.org/W3173361933","https://openalex.org/W167435155","https://openalex.org/W4285101991","https://openalex.org/W4281613391","https://openalex.org/W2566098902"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}