Abstract: In this paper we prove that deciding whether a distributed system (represented as a colored digraph with n nodes) has weak sense of direction is in AC1 (using n6 processors). Moreover, we show that deciding sense of direction is in P. Our algorithms can also be used to decide in AC1 whether a colored graph is a Cayley color graph.
Publication Year: 2000
Publication Date: 2000-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 14
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot