Local algorithms for edge colorings in UDGs (Q638541): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Link scheduling in wireless sensor networks: distributed edge-coloring revisited / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for finding distance-edge-colorings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Locality in Distributed Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational complexity of strong edge coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A constructive proof of Vizing's theorem / rank | |||
Normal rank | |||
Revision as of 10:22, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local algorithms for edge colorings in UDGs |
scientific article |
Statements
Local algorithms for edge colorings in UDGs (English)
0 references
12 September 2011
0 references
strong edge coloring problems
0 references
unit disk graphs
0 references
