{"id":"https://openalex.org/W2025507316","doi":"https://doi.org/10.1002/1520-684x(200007)31:8<68::aid-scj8>3.0.co;2-j","title":"Parallel network organization algorithm for graph matching and subgraph isomorphism detection","display_name":"Parallel network organization algorithm for graph matching and subgraph isomorphism detection","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2025507316","doi":"https://doi.org/10.1002/1520-684x(200007)31:8<68::aid-scj8>3.0.co;2-j","mag":"2025507316"},"language":"en","primary_location":{"id":"doi:10.1002/1520-684x(200007)31:8<68::aid-scj8>3.0.co;2-j","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1520-684x(200007)31:8<68::aid-scj8>3.0.co;2-j","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","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/A5088119685","display_name":"Keita Maehara","orcid":null},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Keita Maehara","raw_affiliation_strings":["Department of Computer and Systems Engineering, Faculty of Engineering, Kobe University, Kobe, Japan 657-8501","Department of Computer and Systems Engineering, Faculty of Engineering, Kobe University, Kobe, Japan 657\u20108501"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Systems Engineering, Faculty of Engineering, Kobe University, Kobe, Japan 657-8501","institution_ids":["https://openalex.org/I65837984"]},{"raw_affiliation_string":"Department of Computer and Systems Engineering, Faculty of Engineering, Kobe University, Kobe, Japan 657\u20108501","institution_ids":["https://openalex.org/I65837984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023847482","display_name":"Kuniaki Uehara","orcid":"https://orcid.org/0000-0002-7160-3752"},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kuniaki Uehara","raw_affiliation_strings":["Research Center for Urban Safety and Security, Kobe University, Kobe, Japan 657-8501"],"affiliations":[{"raw_affiliation_string":"Research Center for Urban Safety and Security, Kobe University, Kobe, Japan 657-8501","institution_ids":["https://openalex.org/I65837984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088119685"],"corresponding_institution_ids":["https://openalex.org/I65837984"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13573896,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"8","first_page":"68","last_page":"78"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.7809554934501648},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7285687923431396},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7002964615821838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6647628545761108},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5556657314300537},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.46525293588638306},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44891107082366943},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4323091208934784},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41511303186416626},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37481236457824707},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24408981204032898},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10113105177879333}],"concepts":[{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.7809554934501648},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7285687923431396},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7002964615821838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6647628545761108},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5556657314300537},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.46525293588638306},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44891107082366943},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4323091208934784},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41511303186416626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37481236457824707},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24408981204032898},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10113105177879333},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/1520-684x(200007)31:8<68::aid-scj8>3.0.co;2-j","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1520-684x(200007)31:8<68::aid-scj8>3.0.co;2-j","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","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":5,"referenced_works":["https://openalex.org/W1976875352","https://openalex.org/W2105686649","https://openalex.org/W2111057027","https://openalex.org/W2116502002","https://openalex.org/W2124996875"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W2954463587","https://openalex.org/W2393701947","https://openalex.org/W2915540008","https://openalex.org/W1965191464","https://openalex.org/W2128390795","https://openalex.org/W2905073546","https://openalex.org/W3080158623","https://openalex.org/W2183579781","https://openalex.org/W2494517118"],"abstract_inverted_index":{"Data":[0],"representations":[1],"using":[2,112],"graphs":[3,54,80,90],"are":[4,8],"very":[5],"flexible":[6],"and":[7,39,91],"used":[9],"in":[10,55,81],"a":[11,36,46,85,96],"wide":[12],"variety":[13],"of":[14,18,53,87],"fields.":[15],"The":[16],"development":[17],"algorithms":[19],"to":[20],"perform":[21],"basic":[22],"processing":[23,63,108],"at":[24],"high":[25],"speeds":[26],"is":[27],"vital":[28],"for":[29,40,42,62],"detecting":[30],"subgraphs":[31,43],"with":[32],"important":[33],"meaning":[34],"from":[35,83],"graph":[37],"set":[38,86],"searching":[41],"which":[44,74,77],"match":[45],"given":[47],"graph.":[48],"However,":[49],"as":[50],"the":[51,58,69,100,113],"number":[52],"question":[56],"increases,":[57],"computation":[59],"costs":[60],"required":[61],"rise":[64],"dramatically.":[65],"In":[66],"this":[67],"paper,":[68],"authors":[70],"describe":[71],"an":[72],"algorithm":[73,104],"detects":[75],"isomorphisms":[76],"have":[78],"several":[79],"common":[82],"among":[84],"labeled":[88],"directed":[89],"then":[92],"organizes":[93],"them":[94],"into":[95],"network":[97],"based":[98],"on":[99],"detected":[101],"isomorphisms.":[102],"This":[103],"also":[105],"provides":[106],"greater":[107],"speed":[109],"through":[110],"heuristics":[111],"MDL":[114],"(Minimum":[115],"Description":[116],"Length)":[117],"principle.":[118],"\u00a9":[119],"2000":[120,128],"Scripta":[121],"Technica,":[122],"Syst":[123],"Comp":[124],"Jpn,":[125],"31(8):":[126],"68\u201378,":[127]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
