Radiocoloring in planar graphs: Complexity and approximations (Q2566036)
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 2207197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Radiocoloring in planar graphs: Complexity and approximations |
scientific article; zbMATH DE number 2207197 |
Statements
Radiocoloring in planar graphs: Complexity and approximations (English)
0 references
22 September 2005
0 references
computational complexity
0 references
Frequency Assignment Problem
0 references
transmitters
0 references
