Sense of direction in distributed computing
type: Item
instance of: scholarly article
title: Sense of direction in distributed computing
zbMATH Open document ID: 1026.68009
DOI: 10.1016/S0304-3975(01)00395-4
author: P. Flocchini
author: Bernard Mans
author: N. Santoro
published in: Theoretical Computer Science
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 1909883
zbMATH Keywords: labeled graphs
MaRDI profile type: Publication
cites work: Efficient elections in chordal ring networks
cites work: Computing on an anonymous ring
cites work: A trade-off between information and communication in broadcast protocols
cites work: Coverings that preserve sense of direction
cites work: Minimal sense of direction and decision problems for Cayley graphs
cites work: Complexity of Deciding Sense of Direction
cites work: Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
cites work: Broadcasting in unlabeled hypercubes with a linear number of messages.
cites work: Perfect broadcasting in unlabeled networks
cites work: Q4232777
cites work: Minimal sense of direction in regular networks
cites work: On the impact of sense of direction on message complexity
cites work: Sense of direction: Definitions, properties, and classes
cites work: Computing on anonymous networks with sense of direction
cites work: Symmetries and sense of direction in labeled graphs
cites work: Backward consistency and sense of direction in advanced distributed systems
cites work: TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
cites work: Cycle regular graphs need not be transitive
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: Q4385172
cites work: Towards optimal distributed election on chordal rings
cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
cites work: Distributed Computing on Anonymous Hypercube Networks
cites work: A fully distributed (minimal) spanning tree algorithm
cites work: Optimal distributed algorithms in unlabeled tori and chordal rings
cites work: Optimal elections in faulty loop networks and applications
cites work: A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
cites work: On the message complexity of distributed problems
cites work: Q3332237
cites work: Efficient leader election using sense of direction
cites work: Perspective in a box
description: scientific article; zbMATH DE number 1909883