Mobile Agents Implementing Local Computations in Graphs
From MaRDI portal
Recommendations
- Mobile agents in distributed computing: network exploration
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
- Local Maps: New Insights into Mobile Agent Algorithms
- An Algorithmic Theory of Mobile Agents
- scientific article; zbMATH DE number 1955863
- Interacting with networks of mobile agents
- A distributed implementation of mobile nets as mobile agents
- A calculus of mobile agents
Cites work
- scientific article; zbMATH DE number 5855082 (Why is no real title available?)
- scientific article; zbMATH DE number 1552336 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Analysis of a randomized rendezvous algorithm
- Different local controls for graph relabeling systems
- Experimental and Efficient Algorithms
- Graph Labelings Derived from Models in Distributed Computing
- Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
- On the recognition of families of graphs with local computations
- Randomized local elections.
Cited in
(7)- scientific article; zbMATH DE number 1969692 (Why is no real title available?)
- Mobile agents in distributed computing: network exploration
- Local Maps: New Insights into Mobile Agent Algorithms
- Workshop on Graph Computation Models
- An Algorithmic Theory of Mobile Agents
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
- scientific article; zbMATH DE number 1955863 (Why is no real title available?)
This page was built for publication: Mobile Agents Implementing Local Computations in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540391)
