scientific article; zbMATH DE number 1163304

MaRDI QIDQ4394828zbMATH OpenFDO

Authors Stéphane Ubéda, Janez Žerovnik

Publication date 11 June 1998

zbMATH Keywords

channel allocationfrequency assignmentgraph coloringinterference graphsrandomized algorithm

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 970002
• Channel assignment with \(r\)-dynamic coloring
• scientific article; zbMATH DE number 3853101
• Channel assignment problem and relaxed 2-distant coloring of graphs
• Channel assignment and weighted coloring
• Optimal channel assignment with list-edge coloring
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• L(p,q)-label coloring problem with application to channel allocation
• An approximation algorithm for channel assignment with certain constraints
• Graph-Theoretic Concepts in Computer Science

Cited in

(6)

• \(L(2,1)\)-labeling of direct product of paths and cycles
• Optimal channel assignment with list-edge coloring
• Channel Dependent Interference and Decentralized Colouring
• A heuristic for fast convergence in interference-free channel assignment using D1EC coloring
• scientific article; zbMATH DE number 1417706 (Why is no real title available?)
• scientific article; zbMATH DE number 970002 (Why is no real title available?)

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