Efficient Search of Combinatorial Maps using Signatures - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2011

Efficient Search of Combinatorial Maps using Signatures

Abstract

In this paper, we address the problem of computing canonical representations of n-dimensional combinatorial maps and of using them for efficiently searching for a map in a database. We define two combinatorial map signatures: the first one has a quadratic space complexity and may be used to decide of isomorphism with a new map in linear time whereas the second one has a linear space complexity and may be used to decide of isomorphism in quadratic time. We show that these signatures can be used to efficiently search for a map in a database.
Fichier principal
Vignette du fichier
tcs-gosselin-solnon-damiand.pdf (537.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00567332 , version 1 (20-02-2011)
hal-00567332 , version 2 (23-06-2017)

Identifiers

Cite

Stéphane Gosselin, Christine Solnon, Guillaume Damiand. Efficient Search of Combinatorial Maps using Signatures. Theoretical Computer Science, 2011, 412 (15), pp.1392-1405. ⟨10.1016/j.tcs.2010.10.029⟩. ⟨hal-00567332v2⟩
265 View
177 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More