Minimal sense of direction and decision problems for Cayley graphs

DOI10.1016/S0020-0190(97)00187-7zbMATH Open1338.68211MaRDI QIDQ293153FDOQ293153

Paolo Boldi, Sebastiano Vigna

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097001877?np=y

zbMATH Keywords

computational complexitydistributed computingCayley graphsdistributed systemssense of direction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Minimal sense of direction in regular networks
• On Finitely Generated Subgroups of a Free Group
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Coverings that preserve sense of direction
• Title not available (Why is that?)
• Weak sense of direction labelings and graph embeddings
• Symmetries and sense of direction in labeled graphs
• Lower bounds for weak sense of direction
• Sense of direction in distributed computing
• Sorting on graphs by adjacent swaps using permutation groups

This page was built for publication: Minimal sense of direction and decision problems for Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293153)