scientific article; zbMATH DE number 1947394
zbMath1020.05062MaRDI QIDQ4411360
Fedor V. Fomin, Gerhard J. Woeginger, Hans L. Bodlaender, Hajo J. Broersma, Artem V. Pyatkin
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610211.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityapproximation algorithmgraph algorithmsfrequency assignmentradio labelingcograph\(k\)-coloring
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: