Complexity of Deciding Sense of Direction

Authors:
Paolo Boldi;Sebastiano Vigna
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 8

More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
On Recognizing Cayley Graphs

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Sense of direction in distributed computing

Theoretical Computer Science - Special issue: Distributed computing
Computing on anonymous networks with sense of direction

Theoretical Computer Science
Lower bounds for weak sense of direction

Journal of Discrete Algorithms
Lower bounds for sense of direction in regular graphs

Distributed Computing
Weak sense of direction labelings and graph embeddings

Discrete Applied Mathematics
Minimal chordal sense of direction and circulant graphs

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.