Colouring weighted bipartite graphs with a co-site constraint
From MaRDI portal
Publication:1586761
DOI10.1016/S0012-365X(00)00110-2zbMath0958.90056MaRDI QIDQ1586761
Publication date: 18 April 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Time slot scheduling of compatible jobs ⋮ A survey on labeling graphs with a condition at distance two ⋮ Approximation algorithms for channel assignment with constraints
This page was built for publication: Colouring weighted bipartite graphs with a co-site constraint
