The Internet Archive has a preservation copy of this work in our general collections.
The file type is
In research on distributed local algorithms it is commonly assumed that each vertex has a unique identifier in the entire graph. However, it turns out that in case of certain classes of graphs (for example not lift-closed bounded degree graphs) identifiers are unnecessary and only a port ordering is needed. One of the open issues was whether identifiers are essential in planar graphs. In this paper, we answer this question and we propose an algorithm which returns constant approximation of thearXiv:1303.2514v2 fatcat:vfh224jdl5f5dl3vd5f7nd5gmy