Using combinatorial maps for algorithms on graphs

In this paper the representation of the embedding of a graph on a surface by a pair of permutations is considered. This representation is used to implement efficiently some algorithms for graphs.