APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
From MaRDI portal
Publication:5284947
DOI10.15807/JORSJ.39.258zbMATH Open0863.90131OpenAlexW1561068705MaRDI QIDQ5284947FDOQ5284947
Authors: Tae Hoon Park, Chae Y. Lee 
Publication date: 10 June 1997
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/94c452a20890d201443bc2cbfac513c38533cc2a
Recommendations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cited In (17)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
- Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment.
- Title not available (Why is that?)
- A column generation and branch-and-cut algorithm for the channel assignment problem
- Distance-constrained grid colouring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems
- A Technique for Estimating the Minimum Number of Frequencies Required for Urban Mobile Radio Communication
- Models and solution techniques for frequency assignment problems
- Simple decentralized graph coloring
- A T-coloring algorithm based on multiagent evolution
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
- Constraint and satisfiability reasoning for graph coloring
This page was built for publication: APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284947)
