DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gu, G. | - |
dc.contributor.author | Nam, Y. | - |
dc.contributor.author | Park, K. | - |
dc.contributor.author | Galil, Z. | - |
dc.contributor.author | Italiano, G.F. | - |
dc.contributor.author | Han, W.-S. | - |
dc.date.accessioned | 2022-06-30T07:40:06Z | - |
dc.date.available | 2022-06-30T07:40:06Z | - |
dc.date.created | 2021-10-17 | - |
dc.date.issued | 2021-04 | - |
dc.identifier.issn | 1084-4627 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/113314 | - |
dc.description.abstract | Graph isomorphism is a core problem in graph analysis of various application domains. Given two graphs, the graph isomorphism problem is to determine whether there exists an isomorphism between them. As real-world graphs are getting bigger and bigger, applications demand practically fast algorithms that can run on large-scale graphs. However, existing approaches such as graph canonization and subgraph isomorphism show limited performances on large-scale graphs either in time or space. In this paper, we propose a new approach to graph isomorphism, which is the framework of pairwise color refinement and efficient backtracking. The main features of our approach are: (1) pairwise color refinement and binary cell mapping (2) compressed CS (candidate space), and (3) partial failing set, which together lead to a much faster and scalable algorithm for graph isomorphism. Extensive experiments with real-world datasets show that our approach outperforms state-of-the-art algorithms by up to orders of magnitude in terms of running time. ? 2021 IEEE. | - |
dc.language | English | - |
dc.publisher | IEEE Computer Society | - |
dc.relation.isPartOf | Proceedings - International Conference on Data Engineering | - |
dc.title | Scalable graph isomorphism: Combining pairwise color refinement and backtracking via compressed candidate space | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/ICDE51399.2021.00122 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | Proceedings - International Conference on Data Engineering, v.2021-April, pp.1368 - 1379 | - |
dc.citation.endPage | 1379 | - |
dc.citation.startPage | 1368 | - |
dc.citation.title | Proceedings - International Conference on Data Engineering | - |
dc.citation.volume | 2021-April | - |
dc.contributor.affiliatedAuthor | Han, W.-S. | - |
dc.identifier.scopusid | 2-s2.0-85112867935 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Conference Paper | - |
dc.subject.keywordPlus | Color | - |
dc.subject.keywordPlus | Graphic methods | - |
dc.subject.keywordPlus | Set theory | - |
dc.subject.keywordPlus | Graph isomorphism | - |
dc.subject.keywordPlus | Graph isomorphism problem | - |
dc.subject.keywordPlus | Orders of magnitude | - |
dc.subject.keywordPlus | Real-world datasets | - |
dc.subject.keywordPlus | Real-world graphs | - |
dc.subject.keywordPlus | Scalable algorithms | - |
dc.subject.keywordPlus | Subgraph isomorphism | - |
dc.subject.keywordPlus | Graph algorithms | - |
dc.subject.keywordPlus | State-of-the-art algorithms | - |
dc.description.journalRegisteredClass | scopus | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.