{"id":"https://openalex.org/W2542507283","doi":"https://doi.org/10.1145/2837060.2837088","title":"Analyzing Subgraph Isomorphism on Graphs with Diverse Structural Properties","display_name":"Analyzing Subgraph Isomorphism on Graphs with Diverse Structural Properties","publication_year":2015,"publication_date":"2015-10-20","ids":{"openalex":"https://openalex.org/W2542507283","doi":"https://doi.org/10.1145/2837060.2837088","mag":"2542507283"},"language":"en","primary_location":{"id":"doi:10.1145/2837060.2837088","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837060.2837088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 International Conference on Big Data Applications and Services","raw_type":"proceedings-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/A5071976107","display_name":"Noorul Amin","orcid":null},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Noorul Amin","raw_affiliation_strings":["Dept. of Computer Engineering, Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Engineering, Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045182513","display_name":"Kifayat Ullah Khan","orcid":"https://orcid.org/0000-0002-3916-1659"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kifayat Ullah Khan","raw_affiliation_strings":["Dept. of Computer Engineering, Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Engineering, Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039165136","display_name":"Young-Koo Lee","orcid":"https://orcid.org/0000-0003-2314-5395"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young-Koo Lee","raw_affiliation_strings":["Dept. of Computer Engineering, Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Engineering, Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, Korea","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23797335,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"170","last_page":"174"},"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.9973000288009644,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9625066518783569},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.9539927244186401},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.825553297996521},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.7387596368789673},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.7157266139984131},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.7135187387466431},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.6979751586914062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5046461820602417},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4851420819759369},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.45588740706443787},{"id":"https://openalex.org/keywords/graph-automorphism","display_name":"Graph automorphism","score":0.41695499420166016},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3933950364589691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3854505717754364},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35934990644454956},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2675313353538513},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.18649983406066895}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.9625066518783569},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.9539927244186401},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.825553297996521},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.7387596368789673},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.7157266139984131},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.7135187387466431},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.6979751586914062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5046461820602417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4851420819759369},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.45588740706443787},{"id":"https://openalex.org/C6049932","wikidata":"https://www.wikidata.org/wiki/Q834981","display_name":"Graph automorphism","level":5,"score":0.41695499420166016},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3933950364589691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3854505717754364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35934990644454956},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2675313353538513},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.18649983406066895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2837060.2837088","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837060.2837088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 International Conference on Big Data Applications and Services","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1699659737","https://openalex.org/W1856037611","https://openalex.org/W2012066443","https://openalex.org/W2018149742","https://openalex.org/W2035173902","https://openalex.org/W2055935910","https://openalex.org/W2056477044","https://openalex.org/W2082190556","https://openalex.org/W2083235381","https://openalex.org/W2099083325","https://openalex.org/W2100586946","https://openalex.org/W2108781142","https://openalex.org/W2126359798","https://openalex.org/W2140840007","https://openalex.org/W2143363350","https://openalex.org/W2147405597","https://openalex.org/W2165515835","https://openalex.org/W2254833717","https://openalex.org/W2964277278"],"related_works":["https://openalex.org/W2953496651","https://openalex.org/W3208942821","https://openalex.org/W2886672068","https://openalex.org/W2393701947","https://openalex.org/W2252464404","https://openalex.org/W4245682093","https://openalex.org/W167435155","https://openalex.org/W4213101802","https://openalex.org/W2946681422","https://openalex.org/W2359640428"],"abstract_inverted_index":{"Isomorphic":[0],"subgraphs":[1],"finding":[2],"is":[3],"important":[4],"in":[5],"many":[6],"real":[7,124],"world":[8,125],"applications.":[9],"Being":[10],"NP-hard":[11],"problem,":[12],"various":[13],"approaches":[14],"have":[15],"been":[16,62],"proposed":[17],"by":[18,65,74,93],"varying":[19],"indexing,":[20],"candidate":[21],"generation,":[22],"early":[23],"pruning":[24],"of":[25,41,117],"unpromising":[26],"regions,":[27],"and":[28,47,103,114],"graph":[29,45,92,118],"traversal.":[30],"While,":[31],"recent":[32],"research":[33],"additionally":[34],"emphasis":[35],"on":[36,88,111,121],"taking":[37],"into":[38],"account":[39],"order":[40],"query":[42],"or":[43],"data":[44],"vertices":[46],"compressing":[48],"to":[49],"make":[50],"it":[51],"best":[52],"fit":[53],"for":[54,101],"subgraph":[55,58,85,108],"isomorphism.":[56],"However,":[57],"isomorphism":[59,69,86,109],"has":[60],"not":[61],"evaluated":[63],"deeply":[64],"summarized":[66,76,104,115],"graph.":[67,105,126],"Subgraph":[68],"performance":[70,87,110],"can":[71],"be":[72],"improved":[73],"using":[75,94],"graphs":[77],"with":[78],"exactness.":[79],"For":[80],"this":[81],"purpose,":[82],"we":[83],"evaluate":[84,107],"a":[89],"single":[90],"large":[91],"backtracking":[95],"algorithm.":[96],"We":[97,106],"extend":[98],"Ullman":[99],"algorithm":[100],"original":[102,113],"both":[112],"version":[116],"through":[119],"experiments":[120],"publically":[122],"available":[123]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}