The following pages link to Graph searching with advice (Q1008727):
Displaying 21 items.
- Topology recognition with advice (Q259077) (← links)
- More agents may decrease global work: a case in butterfly decontamination (Q343925) (← links)
- Drawing maps with advice (Q433400) (← links)
- Connected graph searching (Q690489) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Network decontamination under \(m\)-immunity (Q908298) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- (Q5002836) (← links)
- Deterministic Graph Exploration with Advice (Q5111464) (← links)
- Graph Searching with Advice (Q5425960) (← links)
- Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
