On the Power of Local Orientations

We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique labels

• Type: Conference
• Year: 2008
• Where: SIROCCO
• Authors: Monika Steinová
• Keywords: Algorithm, Connected Undirected Graph, Information Technology, Local Orientations, SIROCCO 2008