scientific article; zbMATH DE number 1947394

MaRDI QIDQ4411360zbMATH OpenFDO

Authors Fedor V. Fomin, Gerhard J. Woeginger, Hans L. Bodlaender, Hajo Broersma, Artem Pyatkin

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610211.htm

zbMATH Keywords

\(k\)-coloringapproximation algorithmcographcomputational complexityfrequency assignmentgraph algorithmsradio labeling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Radio Labeling with Preassigned Frequencies
• scientific article; zbMATH DE number 1795717
• scientific article; zbMATH DE number 1263991
• scientific article; zbMATH DE number 1862255
• Bounds for the frequency assignment problem

Cited in

(4)

• Local Labeling and Resource Allocation Using Preprocessing
• scientific article; zbMATH DE number 1795717 (Why is no real title available?)
• Radio Labeling with Preassigned Frequencies
• On algorithms for (P₅, gem)-free graphs

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 Q4411360)