Efficient search of combinatorial maps using signatures

@article{Gosselin2011EfficientSO,
  title={Efficient search of combinatorial maps using signatures},
  author={St{\'e}phane Gosselin and Guillaume Damiand and Christine Solnon},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={412},
  pages={1392-1405}
}
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… CONTINUE READING