Pages that link to "Item:Q580985"

The following pages link to Algorithms for some graph problems on a distributed computational model (Q580985):

Displaying 6 items.

• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
• Fast parallel graph searching with applications (Q1103409) (← links)
• Distributed processing of graphs: Fundamental cycles algorithm (Q1186357) (← links)
• Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
• An efficient distributed bridge-finding algorithm (Q1894245) (← links)
• On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)