Scott : A method for representing graphs as rooted trees for graph canonization - Archive ouverte HAL Access content directly
Book Sections Year : 2019

Scott : A method for representing graphs as rooted trees for graph canonization

Abstract

Graphs increasingly stand out as an essential data structure in the field of data sciences. To study graphs, or sub-graphs, that char- acterize a set of observations, it is necessary to describe them formally, in order to characterize equivalence relations that make sense in the scope of the considered application domain. Hence we seek to define a canonical graph notation, so that two isomorphic (sub) graphs have the same canonical form. Such notation could subsequently be used to index and retrieve graphs or to embed them efficiently in some metric space. Sequential optimized algorithms solving this problem exist, but do not deal with labeled edges, a situation that occurs in important application domains such as chemistry. We present in this article a new algorithm based on graph rewriting that provides a general and complete solution to the graph canonization problem. Although not reported here, the formal proof of the validity of our algorithm has been established. This claim is clearly supported empirically by our experimentation on synthetic com- binatorics as well as natural graphs. Furthermore, our algorithm supports distributed implementations, leading to efficient computing perspectives.
Fichier principal
Vignette du fichier
main.pdf (424.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02314658 , version 1 (19-12-2019)

Identifiers

Cite

Nicolas Bloyet, Pierre-François Marteau, Emmanuel Frenod. Scott : A method for representing graphs as rooted trees for graph canonization. COMPLEX NETWORKS 2019, Springer, pp.578-590, 2019, Studies in Computational Intelligence Series, ⟨10.1007/978-3-030-36687-2_48⟩. ⟨hal-02314658⟩
219 View
426 Download

Altmetric

Share

Gmail Facebook X LinkedIn More