{"id":"https://openalex.org/W2164155173","doi":"https://doi.org/10.1007/s004530010023","title":"Faster Algorithms for Subgraph Isomorphism of \\sl k -Connected Partial \\sl k -Trees","display_name":"Faster Algorithms for Subgraph Isomorphism of \\sl k -Connected Partial \\sl k -Trees","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W2164155173","doi":"https://doi.org/10.1007/s004530010023","mag":"2164155173"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010023","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010023","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5052324814","display_name":"Anders Dessmark","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":"A. Dessmark","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , , , , , SE","Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , SE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , , , , , SE","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , SE","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","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"]},{"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","US"],"is_corresponding":false,"raw_author_name":"A. Proskurowski","raw_affiliation_strings":["Department of Computer and Information Science, University of Oregon, Eugene, OR 97403, USA. andrzej@cs.uoregon.edu., , , , , , US","Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , SE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Oregon, Eugene, OR 97403, USA. andrzej@cs.uoregon.edu., , , , , , US","institution_ids":["https://openalex.org/I181233156"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , SE","institution_ids":["https://openalex.org/I187531555"]}]},{"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/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]},{"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","US"],"is_corresponding":false,"raw_author_name":"A. Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , , , , , SE","Department of Computer and Information Science, University of Oregon, Eugene, OR 97403, USA. andrzej@cs.uoregon.edu., US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 117, S-221 00 Lund, Sweden. Anders.Dessmark@cs.lth.se, Andrzej.Lingas@cs.lth.se., , , , , , SE","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer and Information Science, University of Oregon, Eugene, OR 97403, USA. andrzej@cs.uoregon.edu., US","institution_ids":["https://openalex.org/I181233156"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.8789,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.86698635,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"27","issue":"3","first_page":"337","last_page":"347"},"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.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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7782025337219238},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7388615608215332},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6528803110122681},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.6457885503768921},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5943482518196106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5139867663383484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4949473738670349},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40136468410491943},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19561269879341125},{"id":"https://openalex.org/keywords/crystallography","display_name":"Crystallography","score":0.0752890408039093},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.07006695866584778},{"id":"https://openalex.org/keywords/crystal-structure","display_name":"Crystal structure","score":0.06631603837013245},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06240653991699219}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7782025337219238},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7388615608215332},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6528803110122681},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.6457885503768921},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5943482518196106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5139867663383484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4949473738670349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40136468410491943},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19561269879341125},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0752890408039093},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.07006695866584778},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.06631603837013245},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06240653991699219},{"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.1007/s004530010023","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010023","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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":11,"referenced_works":["https://openalex.org/W1515227792","https://openalex.org/W1544045550","https://openalex.org/W2012834021","https://openalex.org/W2024291212","https://openalex.org/W2071484148","https://openalex.org/W2076043677","https://openalex.org/W2157529519","https://openalex.org/W2476096155","https://openalex.org/W2530747039","https://openalex.org/W2799004609","https://openalex.org/W2914443076"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2905073546","https://openalex.org/W2183579781","https://openalex.org/W3080158623"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}