{"id":"https://openalex.org/W1993889441","doi":"https://doi.org/10.3390/a7020243","title":"Efficient Algorithms for Subgraph Listing","display_name":"Efficient Algorithms for Subgraph Listing","publication_year":2014,"publication_date":"2014-05-15","ids":{"openalex":"https://openalex.org/W1993889441","doi":"https://doi.org/10.3390/a7020243","mag":"1993889441"},"language":"en","primary_location":{"id":"doi:10.3390/a7020243","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a7020243","pdf_url":"https://www.mdpi.com/1999-4893/7/2/243/pdf?version=1400139925","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/7/2/243/pdf?version=1400139925","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078980344","display_name":"Niklas Zechner","orcid":"https://orcid.org/0000-0001-6669-0698"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Niklas Zechner","raw_affiliation_strings":["Department of Computing Science, Umea University, 901 87 Umea, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Umea University, 901 87 Umea, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"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":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, 221 00 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, 221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078980344"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.06918701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":"2","first_page":"243","last_page":"252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9965999722480774,"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.7288087606430054},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6953604817390442},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6443085670471191},{"id":"https://openalex.org/keywords/listing","display_name":"Listing (finance)","score":0.5555475354194641},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5206484198570251},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5127509832382202},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48169049620628357},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42303386330604553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40567660331726074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36441367864608765},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.27837616205215454},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.23961541056632996}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7288087606430054},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6953604817390442},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6443085670471191},{"id":"https://openalex.org/C2779820595","wikidata":"https://www.wikidata.org/wiki/Q798505","display_name":"Listing (finance)","level":2,"score":0.5555475354194641},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5206484198570251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5127509832382202},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48169049620628357},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42303386330604553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40567660331726074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36441367864608765},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27837616205215454},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.23961541056632996},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a7020243","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a7020243","pdf_url":"https://www.mdpi.com/1999-4893/7/2/243/pdf?version=1400139925","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:umu-211926","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-211926","pdf_url":null,"source":{"id":"https://openalex.org/S4306400361","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"},{"id":"pmh:oai:doaj.org/article:b6ebb729c2b54eb2a3d0754a56ca2184","is_oa":true,"landing_page_url":"https://doaj.org/article/b6ebb729c2b54eb2a3d0754a56ca2184","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 7, Iss 2, Pp 243-252 (2014)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/7/2/243/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a7020243","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 7; Issue 2; Pages: 243-252","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a7020243","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a7020243","pdf_url":"https://www.mdpi.com/1999-4893/7/2/243/pdf?version=1400139925","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1993889441.pdf","grobid_xml":"https://content.openalex.org/works/W1993889441.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1489509891","https://openalex.org/W1574303240","https://openalex.org/W1632413416","https://openalex.org/W1979740015","https://openalex.org/W1989420494","https://openalex.org/W1991858502","https://openalex.org/W2011039300","https://openalex.org/W2019827052","https://openalex.org/W2038073775","https://openalex.org/W2055245094","https://openalex.org/W2114177725","https://openalex.org/W2752885492","https://openalex.org/W2951040528","https://openalex.org/W2963888752","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W1482551403","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947"],"abstract_inverted_index":{"Subgraph":[0],"isomorphism":[1],"is":[2],"a":[3,19,69,78,87,90],"fundamental":[4],"problem":[5],"in":[6,86],"graph":[7],"theory.":[8],"In":[9],"this":[10],"paper":[11],"we":[12,24,55,92],"focus":[13],"on":[14],"listing":[15,35,83,98],"subgraphs":[16,37,50,99,102],"isomorphic":[17,103],"to":[18,30,48,60,76,104],"given":[20],"pattern":[21,108],"graph.":[22,88,109],"First,":[23],"look":[25],"at":[26],"the":[27,57],"algorithm":[28,58,81,96],"due":[29,59],"Chiba":[31],"and":[32,41,73,100],"Nishizeki":[33],"for":[34,64,82,97],"complete":[36],"of":[38,51,68],"fixed":[39,52,107],"size,":[40],"show":[42],"that":[43],"it":[44,75],"cannot":[45],"be":[46],"extended":[47],"general":[49],"size.":[53],"Then,":[54],"consider":[56],"Ga\u0327sieniec":[61],"et":[62],"al.":[63],"finding":[65],"multiple":[66],"witnesses":[67],"Boolean":[70],"matrix":[71],"product,":[72],"use":[74],"design":[77],"new":[79],"output-sensitive":[80,95],"all":[84],"triangles":[85],"As":[89],"corollary,":[91],"obtain":[93],"an":[94,105],"induced":[101],"arbitrary":[106]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}