Sense of direction in distributed computing
From MaRDI portal
Publication:1870525
DOI10.1016/S0304-3975(01)00395-4zbMath1026.68009MaRDI QIDQ1870525
Bernard Mans, Nicola Santoro, Paola Flocchini
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (12)
Exploration of Time-Varying Connected Graphs with Silent Agents ⋮ Improved periodic data retrieval in asynchronous rings with a faulty host ⋮ Weak sense of direction labelings and graph embeddings ⋮ Rendezvous Problem ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ A decision-theoretic approach to reliable message delivery ⋮ Interval routing schemes allow broadcasting with linear message-complexity ⋮ Lower bounds for sense of direction in regular graphs ⋮ Setting port numbers for fast graph exploration ⋮ Tree exploration with advice ⋮ An Algorithmic Theory of Mobile Agents ⋮ A survey on interval routing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the impact of sense of direction on message complexity
- Minimal sense of direction in regular networks
- Minimal sense of direction and decision problems for Cayley graphs
- Perspective in a box
- A fully distributed (minimal) spanning tree algorithm
- Towards optimal distributed election on chordal rings
- Efficient elections in chordal ring networks
- Perfect broadcasting in unlabeled networks
- Symmetries and sense of direction in labeled graphs
- A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
- Optimal distributed algorithms in unlabeled tori and chordal rings
- Computing on anonymous networks with sense of direction
- Coverings that preserve sense of direction
- Broadcasting in unlabeled hypercubes with a linear number of messages.
- Backward consistency and sense of direction in advanced distributed systems
- Distributed Computing on Anonymous Hypercube Networks
- On the message complexity of distributed problems
- A trade-off between information and communication in broadcast protocols
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- Computing on an anonymous ring
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Sense of direction: Definitions, properties, and classes
- Optimal elections in faulty loop networks and applications
- Complexity of Deciding Sense of Direction
- Efficient leader election using sense of direction
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
- Cycle regular graphs need not be transitive
This page was built for publication: Sense of direction in distributed computing
