Pages that link to "Item:Q613116"

The following pages link to Local MST computation with short advice (Q613116):

Displaying 25 items.

• Topology recognition with advice (Q259077) (← links)
• Drawing maps with advice (Q433400) (← links)
• Online computation with advice (Q541670) (← links)
• Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
• Fast rendezvous with advice (Q896137) (← links)
• Tree exploration with advice (Q958304) (← 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)
• Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
• Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
• How to use spanning trees to navigate in graphs (Q2375948) (← links)
• Proof labeling schemes (Q2377139) (← links)
• Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
• The ANTS problem (Q2401118) (← links)
• Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← 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)
• How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
• Fast Radio Broadcasting with Advice (Q3511406) (← links)
• Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
• Short labeling schemes for topology recognition in wireless tree networks (Q5915998) (← links)
• Deterministic size discovery and topology recognition in radio networks with short labels (Q6040656) (← 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)