Pages that link to "Item:Q2566036"
From MaRDI portal
The following pages link to Radiocoloring in planar graphs: Complexity and approximations (Q2566036):
Displaying 12 items.
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Bounds on vertex colorings with restrictions on the union of color classes (Q3083409) (← links)
- (Q3152424) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- Approximations for -Colorings of Graphs (Q4470433) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- OPTIMAL RADIOCOLORING OF TREES (Q5221077) (← links)
- Experimental and Efficient Algorithms (Q5710030) (← links)
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)
