Publication Information

{'id': 'https://openalex.org/W167435155', 'doi': None, 'title': 'Improvement of Messmer’s Approach to Subgraph Isomorphism Detection', 'display_name': 'Improvement of Messmer’s Approach to Subgraph Isomorphism Detection', 'publication_year': 2005, 'publication_date': '2005-01-01', 'ids': {'openalex': 'https://openalex.org/W167435155', 'mag': '167435155'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://www.ieice.org/iss/de/DEWS/DEWS2005/procs/papers/5B-i8.pdf', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5028579045', 'display_name': 'Shotaro Nishimura', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Shotaro Nishimura', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5044664623', 'display_name': 'Kaoru Katayama', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Kaoru Katayama', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'middle', 'author': {'id': 'https://openalex.org/A5102050481', 'display_name': 'Manabu Ohta', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Manabu Ohta', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5061044862', 'display_name': 'Hiroshi Ishikawa', 'orcid': 'https://orcid.org/0000-0001-6310-5748'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Hiroshi Ishikawa', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, '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': {'min': 0, 'max': 61}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T12292', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9999, '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.9999, '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.9751, '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/T10829', 'display_name': 'Interconnection Networks and Systems', 'score': 0.9639, 'subfield': {'id': 'https://openalex.org/subfields/1705', 'display_name': 'Computer Networks and Communications'}, '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.9215753}, {'id': 'https://openalex.org/keywords/graph-isomorphism', 'display_name': 'Graph isomorphism', 'score': 0.84176177}, {'id': 'https://openalex.org/keywords/distance-hereditary-graph', 'display_name': 'Distance-hereditary graph', 'score': 0.74017656}, {'id': 'https://openalex.org/keywords/graph-factorization', 'display_name': 'Graph factorization', 'score': 0.69790816}, {'id': 'https://openalex.org/keywords/factor-critical-graph', 'display_name': 'Factor-critical graph', 'score': 0.6155614}, {'id': 'https://openalex.org/keywords/graph-homomorphism', 'display_name': 'Graph homomorphism', 'score': 0.5325047}, {'id': 'https://openalex.org/keywords/cograph', 'display_name': 'Cograph', 'score': 0.5301605}, {'id': 'https://openalex.org/keywords/graph-property', 'display_name': 'Graph property', 'score': 0.45007068}, {'id': 'https://openalex.org/keywords/modular-decomposition', 'display_name': 'Modular decomposition', 'score': 0.43382218}, {'id': 'https://openalex.org/keywords/graph-automorphism', 'display_name': 'Graph automorphism', 'score': 0.4326738}, {'id': 'https://openalex.org/keywords/block-graph', 'display_name': 'Block graph', 'score': 0.42118722}], 'concepts': [{'id': 'https://openalex.org/C131992880', 'wikidata': 'https://www.wikidata.org/wiki/Q2528185', 'display_name': 'Subgraph isomorphism problem', 'level': 3, 'score': 0.9215753}, {'id': 'https://openalex.org/C191241153', 'wikidata': 'https://www.wikidata.org/wiki/Q6027240', 'display_name': 'Induced subgraph isomorphism problem', 'level': 5, 'score': 0.9193125}, {'id': 'https://openalex.org/C61665672', 'wikidata': 'https://www.wikidata.org/wiki/Q303100', 'display_name': 'Graph isomorphism', 'level': 4, 'score': 0.84176177}, {'id': 'https://openalex.org/C147792647', 'wikidata': 'https://www.wikidata.org/wiki/Q5282847', 'display_name': 'Distance-hereditary graph', 'level': 5, 'score': 0.74017656}, {'id': 'https://openalex.org/C128115575', 'wikidata': 'https://www.wikidata.org/wiki/Q5597083', 'display_name': 'Graph factorization', 'level': 5, 'score': 0.69790816}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.6909032}, {'id': 'https://openalex.org/C36038622', 'wikidata': 'https://www.wikidata.org/wiki/Q5428703', 'display_name': 'Factor-critical graph', 'level': 5, 'score': 0.6155614}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.5934001}, {'id': 'https://openalex.org/C203776342', 'wikidata': 'https://www.wikidata.org/wiki/Q1378376', 'display_name': 'Line graph', 'level': 3, 'score': 0.56066686}, {'id': 'https://openalex.org/C7036158', 'wikidata': 'https://www.wikidata.org/wiki/Q3385162', 'display_name': 'Graph homomorphism', 'level': 5, 'score': 0.5325047}, {'id': 'https://openalex.org/C59824394', 'wikidata': 'https://www.wikidata.org/wiki/Q5141281', 'display_name': 'Cograph', 'level': 5, 'score': 0.5301605}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.48678395}, {'id': 'https://openalex.org/C64339825', 'wikidata': 'https://www.wikidata.org/wiki/Q722659', 'display_name': 'Graph property', 'level': 5, 'score': 0.45007068}, {'id': 'https://openalex.org/C187407849', 'wikidata': 'https://www.wikidata.org/wiki/Q6889712', 'display_name': 'Modular decomposition', 'level': 5, 'score': 0.43382218}, {'id': 'https://openalex.org/C6049932', 'wikidata': 'https://www.wikidata.org/wiki/Q834981', 'display_name': 'Graph automorphism', 'level': 5, 'score': 0.4326738}, {'id': 'https://openalex.org/C43413943', 'wikidata': 'https://www.wikidata.org/wiki/Q4927193', 'display_name': 'Block graph', 'level': 5, 'score': 0.42118722}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.38118356}, {'id': 'https://openalex.org/C22149727', 'wikidata': 'https://www.wikidata.org/wiki/Q7940747', 'display_name': 'Voltage graph', 'level': 4, 'score': 0.31220865}, {'id': 'https://openalex.org/C43517604', 'wikidata': 'https://www.wikidata.org/wiki/Q7144893', 'display_name': 'Pathwidth', 'level': 4, 'score': 0.25694796}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://www.ieice.org/iss/de/DEWS/DEWS2005/procs/papers/5B-i8.pdf', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 1, 'referenced_works': ['https://openalex.org/W2147405597'], 'related_works': ['https://openalex.org/W74612279', 'https://openalex.org/W72957260', 'https://openalex.org/W51555225', 'https://openalex.org/W3177772509', 'https://openalex.org/W3106402536', 'https://openalex.org/W3081491952', 'https://openalex.org/W2993364241', 'https://openalex.org/W2964258525', 'https://openalex.org/W2950670108', 'https://openalex.org/W2786091138', 'https://openalex.org/W2559777123', 'https://openalex.org/W2339922093', 'https://openalex.org/W2278584509', 'https://openalex.org/W2047674557', 'https://openalex.org/W2047591102', 'https://openalex.org/W2032950096', 'https://openalex.org/W1850128396', 'https://openalex.org/W1602306084', 'https://openalex.org/W1422428439', 'https://openalex.org/W131320787'], 'abstract_inverted_index': {'The': [0], 'subgraph': [1, 81], 'isomorphism': [2, 82], 'problem': [3, 6, 27, 49], 'is': [4, 11, 23, 37, 78], 'the': [5, 44, 57, 67], 'of': [7, 31, 69], 'whether': [8], 'one': [9], 'graph': [10, 53, 71, 76], 'contained': [12], 'in': [13, 66, 80], 'another': [14], 'graph,': [15], 'given': [16], 'two': [17], 'graphs.': [18], 'An': [19], 'enormous': [20], 'calculation': [21], 'cost': [22], 'necessary': [24], 'for': [25], 'this': [26, 48], 'when': [28], 'large': [29], 'quantities': [30], 'graphs': [32, 63], 'are': [33, 64], 'handled': [34], 'because': [35], 'it': [36], 'NP': [38], 'complete.': [39], 'Messmer': [40], 'et': [41], 'al.': [42], 'propose': [43], 'algorithm': [45], 'to': [46], 'solve': [47], 'efficiently': [50], 'based': [51], 'on': [52], 'decomposition.': [54], 'We': [55], 'improve': [56], 'Messmer’s': [58], 'approach': [59], 'so': [60], 'that': [61], 'connected': [62], 'formed': [65], 'decomposition': [68, 77], 'each': [70], 'and': [72], 'information': [73], 'produced': [74], 'by': [75], 'used': [79], 'detection.': [83], 'Keyword': [84], 'Subgraph': [85], 'isomorphism,Graph': [86], 'decomposition,Graph': [87], 'matching': [88]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W167435155', 'counts_by_year': [], 'updated_date': '2024-12-07T07:45:19.469146', 'created_date': '2016-06-24'}