Pages that link to "Item:Q4519133"
From MaRDI portal
The following pages link to Channel assignment and weighted coloring (Q4519133):
Displayed 37 items.
- On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice (Q324981) (← links)
- Better bounds for incremental frequency allocation in bipartite graphs (Q386900) (← links)
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs (Q436606) (← links)
- A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs (Q496697) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- Online call control in cellular networks revisited (Q763482) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Greedy online frequency allocation in cellular networks (Q845962) (← links)
- A constant-competitive algorithm for online OVSF code assignment (Q848939) (← links)
- A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs (Q1040645) (← links)
- Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Homomorphisms of hexagonal graphs to odd cycles (Q1827797) (← links)
- Worst-case analysis of a dynamic channel assignment strategy (Q1827841) (← links)
- Graph imperfection. I (Q1850556) (← links)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs (Q1945170) (← links)
- On the properties of weighted minimum colouring games (Q2095946) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs (Q2390258) (← links)
- A technique for multicoloring triangle-free hexagonal graphs (Q2570123) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs (Q2883583) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS (Q3063610) (← links)
- A class of weakly perfect graphs (Q3073528) (← links)
- Improper Colourings of Unit Disk Graphs (Q3439320) (← links)
- 2-local distributed algorithms for generalized coloring of hexagonal graphs (Q3439359) (← links)
- Online Multi-Coloring with Advice (Q3453285) (← links)
- Three Results on Frequency Assignment in Linear Cellular Networks (Q3638448) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- On irreducible no‐hole <i>L</i>(2, 1)‐coloring of trees (Q5191141) (← links)
- A Constant-Competitive Algorithm for Online OVSF Code Assignment (Q5387778) (← links)
- 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs (Q5747734) (← links)
- Approximation algorithms for channel assignment with constraints (Q5958140) (← links)
- Absolute and asymptotic bounds for online frequency allocation in cellular networks (Q5961981) (← links)