Drawing maps with advice
From MaRDI portal
Publication:433400
DOI10.1016/J.JPDC.2011.10.004zbMATH Open1242.68192OpenAlexW2046334554MaRDI QIDQ433400FDOQ433400
Andrzej Pelc, Dariusz Dereniowski
Publication date: 13 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.10.004
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)
Cites Work
- Distance labeling in graphs
- Graph searching with advice
- The power of a pebble: Exploring and mapping directed graphs
- Proof labeling schemes
- Distributed computing with advice: information sensitivity of graph coloring
- Approximate distance oracles
- Undirected connectivity in log-space
- Labeling Schemes for Flow and Connectivity
- Exploring an unknown graph
- Discrete Mathematics
- Trade-offs between the size of advice and broadcasting time in trees
- Local MST computation with short advice
- Tree exploration with advice
- Fast radio broadcasting with advice
- Distributed enumeration
- Fibrations of graphs
- Exploring Unknown Environments
- Compact Labeling Scheme for Ancestor Queries
- Title not available (Why is that?)
- Online Computation with Advice
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to meet when you forget
- Oracle size
- An efficient message passing election algorithm based on Mazurkiewicz's algorithm
- Automata, Languages and Programming
- Optimal graph exploration without good maps
Cited In (15)
- Topology recognition with advice
- Distributed graph searching with a sense of direction
- Fast rendezvous with advice
- Short labeling schemes for topology recognition in wireless tree networks
- Map construction of unknown graphs by multiple agents
- Impact of knowledge on election time in anonymous networks
- Distinguishing views in symmetric networks: a tight lower bound
- Topology recognition and leader election in colored networks
- Treasure hunt in graph using pebbles
- Title not available (Why is that?)
- Four shades of deterministic leader election in anonymous networks
- Finding the size and the diameter of a radio network using short labels
- Local Maps: New Insights into Mobile Agent Algorithms
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
- Advice complexity of maximum independent set in sparse and bipartite graphs
This page was built for publication: Drawing maps with advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433400)
