An exact algorithm for the channel assignment problem

This publication has 8 references indexed in Scilit:

• On the span in channel assignment problems: bounds, computing and counting
  Discrete Mathematics, 2003
• A Theorem about the Channel Assignment Problem
  SIAM Journal on Discrete Mathematics, 2003
• 3-coloring in time 0(1.3446/sup n/): a no-MIS algorithm
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Fixed-parameter complexity of λ-labelings
  Discrete Applied Mathematics, 2001
• Arrangements, Channel Assignments, and Associated Polynomials
  Advances in Applied Mathematics, 1999
• Deciding 3-colourability in less than O(1.415n) steps
  Published by Springer Nature ,1994
• Labelling Graphs with a Condition at Distance 2
  SIAM Journal on Discrete Mathematics, 1992
• A note on the complexity of the chromatic number problem
  Information Processing Letters, 1976