Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
From MaRDI portal
Publication:2835014
DOI10.1007/978-3-319-48314-6_3zbMath1482.68177OpenAlexW2548018867MaRDI QIDQ2835014
Adrian Kosowski, Dominik Pająk, Ralf Klasing
Publication date: 1 December 2016
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_3
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Network protocols (68M12)
Cites Work
- Unnamed Item
- Drawing maps with advice
- More efficient periodic traversal in anonymous undirected graphs
- Knowledge, level of symmetry, and time of leader election
- Fast periodic graph exploration with constant memory
- Setting port numbers for fast graph exploration
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Computing on anonymous networks with sense of direction
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Leader election for anonymous asynchronous agents in arbitrary networks
- Distinguishing views in symmetric networks: a tight lower bound
- Graph decomposition for memoryless periodic exploration
- Decidability Classes for Mobile Agents Computing
- Exact Quantum Algorithms for the Leader Election Problem
- On the Power of Local Orientations
- Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth
- Computing functions on asynchronous anonymous networks
- Memory Efficient Anonymous Graph Exploration
- Effective Elections for Anonymous Mobile Agents
- Structural Information and Communication Complexity
- Fibrations of graphs
- Topology recognition and leader election in colored networks
This page was built for publication: Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
