Self-stabilizing coloration in anonymous planar networks (Q1041773): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Self-stabilizing systems in spite of distributed control / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A self-stabilizing algorithm for coloring planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear time self-stabilizing colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 25 pretty graph colouring problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3126969 / rank | |||
Normal rank | |||
Revision as of 05:38, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Self-stabilizing coloration in anonymous planar networks |
scientific article |
Statements
Self-stabilizing coloration in anonymous planar networks (English)
0 references
4 December 2009
0 references
vertex coloring
0 references
grundy coloring
0 references
planar graph
0 references
self-stabilization
0 references
fault tolerance
0 references
graph algorithms
0 references
