Vertex coloring with communication and local memory constraints in synchronous broadcast networks (Q1629936)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6990504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex coloring with communication and local memory constraints in synchronous broadcast networks |
scientific article; zbMATH DE number 6990504 |
Statements
Vertex coloring with communication and local memory constraints in synchronous broadcast networks (English)
0 references
7 December 2018
0 references
broadcast/receive
0 references
bounded local memory
0 references
collision-freedom
0 references
distributed algorithm
0 references
message-passing
0 references
multi-coloring
0 references
network traversal
0 references
scalability
0 references
synchronous system
0 references
tree network
0 references
vertex coloring
0 references
0.8783647
0 references
0.8783647
0 references
0.8783322
0 references
0.8769941
0 references
0.87427855
0 references
0.87240016
0 references
0 references
0.86966646
0 references
0 references
