Optimal distributed algorithms in unlabeled tori and chordal rings
From MaRDI portal
(Redirected from Publication:1384522)
Recommendations
- Universally-optimal distributed algorithms for known topologies
- Towards optimal distributed election on chordal rings
- A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
- Distributed Approximation Algorithms in Unit-Disk Graphs
- Round- and message-optimal distributed graph algorithms
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Distributed computing of efficient routing schemes in generalized chordal graphs
- Distributed computing of efficient routing schemes in generalized chordal graphs
Cited in
(15)- Testing set proportionality and the Ádám isomorphism of circulant graphs
- Enumerating typical abelian prime-fold coverings of a circulant graph
- Optimal irreversible dynamos in chordal rings
- A note on the Ádám conjecture for double loops.
- Efficient grid exploration with a stationary token
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- The novel generally described graphs for cyclic orthogonal double covers of some circulants
- Integral circulant graphs
- Optimal routing in double loop networks
- Torus orientation
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Random walks, bisections and gossiping in circulant graphs
- Exploration of High-Dimensional Grids by Finite State Machines
- Sense of direction in distributed computing
This page was built for publication: Optimal distributed algorithms in unlabeled tori and chordal rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384522)
