Better bounds for incremental frequency allocation in bipartite graphs (Q386900): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Channel assignment and weighted coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and solution techniques for frequency assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy online frequency allocation in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute and asymptotic bounds for online frequency allocation in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency Allocation Problems for Linear Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three results on frequency assignment in linear cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs / rank
 
Normal rank

Latest revision as of 03:21, 7 July 2024

scientific article
Language Label Description Also known as
English
Better bounds for incremental frequency allocation in bipartite graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references