The following pages link to Tree exploration with advice (Q958304):
Displayed 20 items.
- Topology recognition with advice (Q259077) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Drawing maps with advice (Q433400) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Lower and upper bounds for deterministic convergecast with labeling schemes (Q2693630) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS (Q4902885) (← links)
- (Q5002836) (← links)
- Introduction to local certification (Q5024672) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- Online search with a hint (Q6186319) (← links)