scientific article; zbMATH DE number 1759423
From MaRDI portal
Publication:4536372
zbMATH Open0996.68515MaRDI QIDQ4536372FDOQ4536372
Authors: Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky Papadopoulou, P. G. Spirakis 
Publication date: 4 November 2002
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cited In (20)
- Experimental and Efficient Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- Graph labellings with variable weights, a survey
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- Approximations for -Colorings of Graphs
- Optimal radiocoloring of trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for graphs with small octopus
- Distance constrained labelings of planar graphs with no short cycles
- Title not available (Why is that?)
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Title not available (Why is that?)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
- Radiocoloring in planar graphs: Complexity and approximations
- Labeling planar graphs with a condition at distance two
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536372)
