## Compact Routing Tables for Graphs of Bounded Genus (2000)

### Cached

### Download Links

- [dept-info.labri.u-bordeaux.fr]
- [ftp.labri.u-bordeaux.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 30 - 12 self |

### BibTeX

@MISC{Gavoille00compactrouting,

author = {Cyril Gavoille and Nicolas Hanusse},

title = {Compact Routing Tables for Graphs of Bounded Genus},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper deals with compact shortest path routing tables on weighted graphs with n nodes. For planar graphs we show how to construct in linear time shortest path routing tables that require 8n + o(n) bits per node, and O(log 2+ n) bit-operations per node to extract the route, for any constant > 0. We obtain the same bounds for graphs of crossing-edge number bounded by o(n= log n), and we generalize for graphs of genus bounded by > 0 yielding a size of n log +O(n) bits per node. Actually we prove a sharp upper bound of 2n log k +O(n) for graphs of pagenumber k, and a lower bound of n log k o(n log k) bits. These results are obtained by the use of dominating sets, compact coding of non-crossing partitions, and k-page representation of graphs.