{"id":"https://openalex.org/W1649819934","doi":"https://doi.org/10.1142/s0218001415500251","title":"Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem","display_name":"Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem","publication_year":2015,"publication_date":"2015-07-05","ids":{"openalex":"https://openalex.org/W1649819934","doi":"https://doi.org/10.1142/s0218001415500251","mag":"1649819934"},"language":"en","primary_location":{"id":"doi:10.1142/s0218001415500251","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001415500251","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","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/A5050977526","display_name":"Uro\u0161 \u010cibej","orcid":null},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Uro\u0161 \u010cibej","raw_affiliation_strings":["Faculty of Computer and Information Science, University of Ljubljana, Ve\u010dna pot 113, 1000, Ljubljana, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer and Information Science, University of Ljubljana, Ve\u010dna pot 113, 1000, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053501152","display_name":"Jurij Miheli\u010d","orcid":"https://orcid.org/0000-0002-7662-4827"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Jurij Miheli\u010d","raw_affiliation_strings":["Faculty of Computer and Information Science, University of Ljubljana, Ve\u010dna pot 113, 1000, Ljubljana, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer and Information Science, University of Ljubljana, Ve\u010dna pot 113, 1000, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":0.551,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.73374421,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"07","first_page":"1550025","last_page":"1550025"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9988999962806702,"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/T11106","display_name":"Data Management and Algorithms","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.889049768447876},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7668153047561646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6185934543609619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6118737459182739},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5861369967460632},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5610384345054626},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5118095278739929},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48046940565109253},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3154986798763275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2863888740539551},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2606968879699707}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.889049768447876},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7668153047561646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6185934543609619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6118737459182739},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5861369967460632},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5610384345054626},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5118095278739929},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48046940565109253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3154986798763275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2863888740539551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2606968879699707},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218001415500251","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001415500251","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Pattern Recognition and Artificial Intelligence","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":34,"referenced_works":["https://openalex.org/W108777047","https://openalex.org/W197513625","https://openalex.org/W1544045550","https://openalex.org/W1559144499","https://openalex.org/W1910918478","https://openalex.org/W1976466396","https://openalex.org/W2004694806","https://openalex.org/W2008734993","https://openalex.org/W2010532254","https://openalex.org/W2026416569","https://openalex.org/W2029059958","https://openalex.org/W2035173902","https://openalex.org/W2036265926","https://openalex.org/W2040080630","https://openalex.org/W2042639302","https://openalex.org/W2043354831","https://openalex.org/W2073919081","https://openalex.org/W2090523415","https://openalex.org/W2100937287","https://openalex.org/W2104748762","https://openalex.org/W2109294083","https://openalex.org/W2118212234","https://openalex.org/W2121884935","https://openalex.org/W2126359798","https://openalex.org/W2132285256","https://openalex.org/W2143163611","https://openalex.org/W2143387021","https://openalex.org/W2147405597","https://openalex.org/W2163184742","https://openalex.org/W2217678137","https://openalex.org/W2241555812","https://openalex.org/W2323427343","https://openalex.org/W2962884946","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W2128390795","https://openalex.org/W2588626627","https://openalex.org/W2018568077","https://openalex.org/W2954463587","https://openalex.org/W2795196889","https://openalex.org/W2155416574","https://openalex.org/W84561889","https://openalex.org/W2126359798","https://openalex.org/W2352767762"],"abstract_inverted_index":{"The":[0,65],"subgraph":[1],"isomorphism":[2],"problem":[3],"is":[4],"one":[5],"of":[6,32,37,77,85,94],"the":[7,33,38,40,58,63,68,74,78,83],"most":[8],"important":[9],"problems":[10],"for":[11,62],"pattern":[12],"recognition":[13],"in":[14,20],"graphs.":[15],"Its":[16],"applications":[17],"are":[18],"found":[19],"many":[21],"different":[22],"disciplines,":[23],"including":[24],"chemistry,":[25],"medicine,":[26],"and":[27,106],"social":[28],"network":[29],"analysis.":[30],"Because":[31],"[Formula:":[34],"see":[35],"text]-completeness":[36],"problem,":[39],"existing":[41],"exact":[42],"algorithms":[43],"exhibit":[44],"an":[45],"exponential":[46],"worst-case":[47],"running":[48],"time.":[49],"In":[50],"this":[51],"paper,":[52],"we":[53],"propose":[54],"several":[55],"improvements":[56,66,95],"to":[57,91],"well-known":[59],"Ullmann's":[60],"algorithm":[61],"problem.":[64],"lower":[67],"time":[69],"consumption":[70],"as":[71,73,98,100],"well":[72,99],"space":[75],"requirements":[76],"algorithm.":[79],"We":[80],"experimentally":[81],"demonstrate":[82],"efficiency":[84],"our":[86],"improvement":[87],"by":[88],"comparing":[89],"it":[90],"another":[92],"set":[93],"called":[96],"FocusSearch,":[97],"other":[101],"state-of-the-art":[102],"algorithms,":[103],"namely":[104],"VF2":[105],"LAD.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}