Complexity of Deciding Sense of Direction

DOI10.1137/S0097539796310801zbMath0941.68054OpenAlexW1975292921MaRDI QIDQ4943845

Paolo Boldi, Sebastiano Vigna

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539796310801

zbMATH Keywords

computational complexitydistributed systemsCayley graphssense of direction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (7)

OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT ⋮ Computing on anonymous networks with sense of direction ⋮ Weak sense of direction labelings and graph embeddings ⋮ Lower bounds for sense of direction in regular graphs ⋮ Lower bounds for weak sense of direction ⋮ Coverings that preserve sense of direction ⋮ Sense of direction in distributed computing

This page was built for publication: Complexity of Deciding Sense of Direction