The channel assignment problem for mutually adjacent sites (Q1336445): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sequences of integers with missing differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of integers with missing differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotic Approach to the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on T-Coloring and Frequency Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Infinite-Difference Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(T\)-colorings of graphs / rank
 
Normal rank

Latest revision as of 09:58, 23 May 2024

scientific article
Language Label Description Also known as
English
The channel assignment problem for mutually adjacent sites
scientific article

    Statements

    The channel assignment problem for mutually adjacent sites (English)
    0 references
    0 references
    0 references
    13 July 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    channel assignment problem
    0 references
    mutually adjacent sites
    0 references
    \(T\)-coloring
    0 references
    optimal span
    0 references
    difference sequence
    0 references
    periodic sequence
    0 references
    0 references