Abstract
Colour refinement is at the heart of all the most efficient graph isomorphism software packages. In this paper we present a method for extending the applicability of refinement algorithms to directed graphs with weighted edges. We use {Traces} as a reference software, but the proposed solution is easily transferrable to any other refinement-based graph isomorphism tool in the literature. We substantiate the claim that the performances of the original algorithm remain substantially unchanged by showing experiments for some classes of benchmark graphs.
BibTeX - Entry
@InProceedings{piperno:LIPIcs:2018:8965,
author = {Adolfo Piperno},
title = {{Isomorphism Test for Digraphs with Weighted Edges}},
booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)},
pages = {30:1--30:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-070-5},
ISSN = {1868-8969},
year = {2018},
volume = {103},
editor = {Gianlorenzo D'Angelo},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8965},
URN = {urn:nbn:de:0030-drops-89659},
doi = {10.4230/LIPIcs.SEA.2018.30},
annote = {Keywords: Practical Graph Isomorphism, Weighted Directed Graphs, Partition Refinement}
}
|
Keywords: |
|
Practical Graph Isomorphism, Weighted Directed Graphs, Partition Refinement |
|
Collection: |
|
17th International Symposium on Experimental Algorithms (SEA 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
19.06.2018 |
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)