Publication:5915998

DOI10.1007/978-3-319-72050-0_3zbMath1496.68040arXiv1704.01927OpenAlexW2606936450MaRDI QIDQ5915998

Andrzej Pelc, Barun Gorain

Publication date: 12 April 2018

Published in: Theoretical Computer Science, Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.01927

zbMATH Keywords

treewireless networkfeasibilitytopology recognitiontimelabeling scheme

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Finding the size and the diameter of a radio network using short labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Lower and upper bounds for deterministic convergecast with labeling schemes ⋮ Edge exploration of anonymous graph by mobile agent with external help ⋮ Short labeling schemes for topology recognition in wireless tree networks

Cites Work

• Unnamed Item
• Topology recognition with advice
• Leader election in ad hoc radio networks: a keen ear helps
• Drawing maps with advice
• Online computation with advice
• Trade-offs between the size of advice and broadcasting time in trees
• Local MST computation with short advice
• Deterministic communication in radio networks with large labels
• Tree exploration with advice
• Fast radio broadcasting with advice
• Communication algorithms with advice
• Graph searching with advice
• Faster communication in known topology radio networks
• Proof labeling schemes
• Distributed computing with advice: information sensitivity of graph coloring
• Fast broadcasting and gossiping in radio networks
• Distributed Computing: A Locality-Sensitive Approach
• Labeling Schemes for Flow and Connectivity
• Distance labeling in graphs
• Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
• Label-guided graph exploration by a finite automaton
• Short labeling schemes for topology recognition in wireless tree networks

This page was built for publication: Short labeling schemes for topology recognition in wireless tree networks