Pages that link to "Item:Q1763143"
From MaRDI portal
The following pages link to An experimental analysis of simple, distributed vertex coloring algorithms (Q1763143):
Displaying 5 items.
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- Vertex coloring with communication and local memory constraints in synchronous broadcast networks (Q1629936) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- Fast Distributed Algorithms for Brooks–Vizing Colorings (Q4512574) (← links)