Better bounds for incremental frequency allocation in bipartite graphs
DOI10.1016/J.TCS.2012.05.020zbMATH Open1277.68023OpenAlexW2800868740MaRDI QIDQ386900FDOQ386900
Authors: Marek Chrobak, Łukasz Jeż, Jiří Sgall 
Publication date: 11 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.020
Recommendations
- Better bounds for incremental frequency allocation in bipartite graphs
- Three Results on Frequency Assignment in Linear Cellular Networks
- Three results on frequency assignment in linear cellular networks
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- Frequency Allocation Problems for Linear Cellular Networks
Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Static frequency assignment in cellular networks
- Channel assignment and weighted coloring
- Frequency Allocation Problems for Linear Cellular Networks
- Three results on frequency assignment in linear cellular networks
- Title not available (Why is that?)
- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
- Models and solution techniques for frequency assignment problems
- Absolute and asymptotic bounds for online frequency allocation in cellular networks
- Greedy online frequency allocation in cellular networks
Cited In (5)
- Online Multi-Coloring with Advice
- Three results on frequency assignment in linear cellular networks
- Online multi-coloring with advice
- Gracefulness of vertex duplicated complete bipartite graph for static and incremental frequency allocation
- Better bounds for incremental frequency allocation in bipartite graphs
Uses Software
This page was built for publication: Better bounds for incremental frequency allocation in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386900)
