Lower bounds for weak sense of direction

DOI10.1016/S1570-8667(03)00021-2MaRDI QIDQ1827281zbMATH OpenFDO

Authors Paolo Boldi, Sebastiano Vigna

Publication date 6 August 2004

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

Distributed computingRandom graphsSense of direction

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1696678
• Lower bounds for sense of direction in regular graphs
• Minimal sense of direction and decision problems for Cayley graphs
• Complexity of Deciding Sense of Direction
• On the impact of sense of direction on message complexity

Cites work

• scientific article; zbMATH DE number 1696678 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• Complexity of Deciding Sense of Direction
• Minimal sense of direction and decision problems for Cayley graphs
• Sense of direction: Definitions, properties, and classes
• Symmetries and sense of direction in labeled graphs

Cited in

(4)

• Lower bounds for sense of direction in regular graphs
• scientific article; zbMATH DE number 1696678 (Why is no real title available?)
• TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
• Weak sense of direction labelings and graph embeddings

This page was built for publication: Lower bounds for weak sense of direction

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