{"id":"https://openalex.org/W2186663447","doi":"https://doi.org/10.20894/ijwt.104.001.002.006","title":"Graph Matching Algorithm-Through Isomorphism Detection","display_name":"Graph Matching Algorithm-Through Isomorphism Detection","publication_year":2012,"publication_date":"2012-12-13","ids":{"openalex":"https://openalex.org/W2186663447","doi":"https://doi.org/10.20894/ijwt.104.001.002.006","mag":"2186663447"},"language":"en","primary_location":{"id":"doi:10.20894/ijwt.104.001.002.006","doi":"https://doi.org/10.20894/ijwt.104.001.002.006","is_oa":false,"landing_page_url":"https://doi.org/10.20894/ijwt.104.001.002.006","pdf_url":null,"source":{"id":"https://openalex.org/S4210205245","display_name":"International Journal of Web Technology","issn_l":"2278-2389","issn":["2278-2389"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Web Technology","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5036334864","display_name":"Logesh Ravi","orcid":"https://orcid.org/0000-0002-0034-4714","observed_orcids":["https://orcid.org/0000-0002-0034-4714"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"L. Ravi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5036334864"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"001","issue":"002","first_page":"54","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0,"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/graph-matching","display_name":"graph matching","score":0.9150000214576721},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.6480000019073486}],"concepts":[{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.7743929624557495},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.6655863523483276},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.5364632606506348},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.5309253334999084},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.5170555710792542},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.507155179977417},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.5070006847381592},{"id":"https://openalex.org/C6049932","wikidata":"https://www.wikidata.org/wiki/Q834981","display_name":"Graph automorphism","level":5,"score":0.5061561465263367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5060703158378601},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.501046895980835},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4871763586997986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4578792452812195},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.4548315703868866},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.43707719445228577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42237621545791626},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4135444760322571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40037497878074646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38967037200927734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3632223904132843},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2626332640647888}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.20894/ijwt.104.001.002.006","doi":"https://doi.org/10.20894/ijwt.104.001.002.006","is_oa":false,"landing_page_url":"https://doi.org/10.20894/ijwt.104.001.002.006","pdf_url":null,"source":{"id":"https://openalex.org/S4210205245","display_name":"International Journal of Web Technology","issn_l":"2278-2389","issn":["2278-2389"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Web Technology","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.678.771","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.678.771","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ijwebt.com/papers/vol1issue2/ijwt-vol1issue2/6.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1735683409","https://openalex.org/W1979842553","https://openalex.org/W1996505263","https://openalex.org/W2031744834","https://openalex.org/W2035389651","https://openalex.org/W2035609387","https://openalex.org/W2047667460","https://openalex.org/W2056778584","https://openalex.org/W2067881095","https://openalex.org/W2084831673","https://openalex.org/W2090022662","https://openalex.org/W2092904196","https://openalex.org/W2095867140","https://openalex.org/W2101511590","https://openalex.org/W2104748762","https://openalex.org/W2108182844","https://openalex.org/W2116018203","https://openalex.org/W2118782734","https://openalex.org/W2122306963","https://openalex.org/W2126359798","https://openalex.org/W2131527483","https://openalex.org/W2136761100","https://openalex.org/W2147405597","https://openalex.org/W2150760714","https://openalex.org/W2152132697","https://openalex.org/W2162551958","https://openalex.org/W2164424155"],"related_works":["https://openalex.org/W7098436682","https://openalex.org/W2783227632","https://openalex.org/W2104748762","https://openalex.org/W7096882691","https://openalex.org/W3177871232","https://openalex.org/W6885114895","https://openalex.org/W2150626884","https://openalex.org/W2417618227","https://openalex.org/W2016868026","https://openalex.org/W2924679056"],"abstract_inverted_index":{"This":[0],"Paper":[1],"delivers":[2],"a":[3,20,23,48,85],"new":[4],"algorithm":[5],"to":[6,42,46],"the":[7,40,52,60,71,77,89,99,108,121,128],"problem":[8,41],"of":[9,101,107,114,116,123,127],"graph":[10,25,35,49,54,73,80,86,91],"isomorphism":[11,50,87],"detection.":[12],"Basically":[13],"this":[14],"method":[15],"is":[16,27,30,45,56,63,74,112],"designed":[17],"in":[18,125],"such":[19],"way":[21],"that,":[22],"model":[24,66,79,117],"which":[26,55,62,82],"known":[28,64],"prior":[29],"compared":[31,75],"with":[32,59,76],"an":[33],"unknown":[34],"called":[36],"input":[37,53,72,90,102],"graph.":[38,67,129],"Now":[39],"be":[43],"solved":[44],"find":[47],"from":[51,88],"given":[57,104,119],"online":[58],"one":[61],"as":[65],"At":[68],"dynamic":[69],"time":[70,95],"entire":[78],"for":[81],"there":[83],"exists":[84],"are":[92],"detected.":[93],"The":[94],"complexity":[96],"depends":[97],"on":[98],"number":[100,115,122],"graphs":[103,118],"and":[105,120],"size":[106],"graphs.":[109],"Furthermore":[110],"it":[111],"independent":[113],"edges":[124],"any":[126]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}