Setting ports in an anonymous network: how to reduce the level of symmetry?

DOI10.1007/978-3-319-48314-6_3zbMATH Open1482.68177OpenAlexW2548018867MaRDI QIDQ2835014FDOQ2835014

Adrian Kosowski, Dominik Pajak, 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

Recommendations

• Assigning labels in unknown anonymous networks (extended abstract)
• Assigning labels in an unknown anonymous network with a leader
• Distinguishing views in symmetric networks: a tight lower bound
• scientific article; zbMATH DE number 3967924
• Randomness vs. time in anonymous networks

zbMATH Keywords

anonymous networklevel of symmetryviewport-labeled network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Network protocols (68M12)

Cites Work

• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Drawing maps with advice
• Leader election for anonymous asynchronous agents in arbitrary networks
• Fibrations of graphs
• More efficient periodic traversal in anonymous undirected graphs
• Setting port numbers for fast graph exploration
• Exact Quantum Algorithms for the Leader Election Problem
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Structural Information and Communication Complexity
• Fast periodic graph exploration with constant memory
• Distinguishing views in symmetric networks: a tight lower bound
• Computing functions on asynchronous anonymous networks
• Knowledge, level of symmetry, and time of leader election
• Title not available (Why is that?)
• Graph decomposition for memoryless periodic exploration
• Memory Efficient Anonymous Graph Exploration
• Computing on anonymous networks with sense of direction
• Decidability Classes for Mobile Agents Computing
• Effective Elections for Anonymous Mobile Agents
• Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth
• On the Power of Local Orientations
• 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?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835014)