Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient Search of Combinatorial Maps using Signatures
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Gosselin, Stéphane Solnon, Christine Damiand, Guillaume |
| 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. |
| Ending Page | 1405 |
| Page Count | 14 |
| Starting Page | 1392 |
| File Format | |
| ISSN | 03043975 |
| DOI | 10.1016/j.tcs.2010.10.029 |
| Journal | Theoretical Computer Science |
| Issue Number | 15 |
| Volume Number | 412 |
| Language | English |
| Publisher | Elsevier |
| Publisher Date | 2011-01-01 |
| Access Restriction | Open |
| Subject Keyword | Combinatorial map map isomorphism signature info Computer Science [cs] Data Structures and Algorithms [cs.DS] |
| Content Type | Text |
| Resource Type | Article |
| Subject | Theoretical Computer Science Computer Science |