Radiocoloring in planar graphs: Complexity and approximations (Q2566036)
From MaRDI portal
 | This is a page for a Wikibase entity. It is used by other Wikibase pages, but it is generally not meant to be viewed directly. See Radiocoloring in planar graphs: Complexity and approximations for the user view. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Radiocoloring in planar graphs: Complexity and approximations |
scientific article |
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
