Colouring weighted bipartite graphs with a co-site constraint

Discrete Mathematics

Volumn 224, Issue 1-3, 2000, Pages 125-138

  Gerke, Stefanie ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Bipartite graphs; Channel assignment; Co site constraint; Colouring

Indexed keywords

EID: 0347646817     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00110-2     Document Type: Article

References (8)

1. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R.E. Tarjan, Faster algorithms for the shortest path problem, J. Assoc. Comput. Mach. 37 (1990) 213-223.
2. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (3) (1976) 237-267.
3. S. Gerke, Channel assignment problems, D.Phil. Thesis, Department of Mathematics, University of Oxford, 2000.
4. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
5. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
6. R. Leese (Ed.), Models and Methods in Radio Frequency Assignment Oxford University Press, Oxford, London, 2000, to appear.
7. L. Lovász, A characterization of perfect graphs, J. Combin. Theory Ser. B 13 (1972) 95-98.
8. D.J.A. Welsh, DIMACS Workshop, Summer 1998.