scientific article; zbMATH DE number 1759423
From MaRDI portal
Publication:4536372
zbMath0996.68515MaRDI QIDQ4536372
Dimitris Fotakis, Vicky G. Papadopoulou, Paul G. Spirakis, Sotiris E. Nikoletseas
Publication date: 4 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (10)
OPTIMAL RADIOCOLORING OF TREES ⋮ Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies ⋮ On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ Algorithms for graphs with small octopus ⋮ Labeling planar graphs with a condition at distance two ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ Radiocoloring in planar graphs: Complexity and approximations
This page was built for publication:
