Radio Labeling with Preassigned Frequencies

DOI10.1137/S1052623402410181MaRDI QIDQ4651992zbMATH OpenWikidataFDO

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

Publication date 23 February 2005

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1052623402410181

zbMATH Keywords

\(k\)-coloringapproximation algorithmassignmentcographcomputational complexitygraph algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 1947394
• scientific article; zbMATH DE number 1263991
• scientific article; zbMATH DE number 1795717
• Bounds for the frequency assignment problem
• scientific article; zbMATH DE number 1862255

Cited in

(5)

• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• Local Labeling and Resource Allocation Using Preprocessing
• scientific article; zbMATH DE number 1947394 (Why is no real title available?)
• The backbone coloring problem for bipartite backbones
• More relations between -labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs

This page was built for publication: Radio Labeling with Preassigned Frequencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651992)