A New Greedy Algorithm for Improving b-Coloring Clustering

Haytham Elghazel, Tetsuya Yoshida, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy. A New Greedy Algorithm for Improving b-Coloring Clustering. In Francisco Escolano, Mario Vento, editors, Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings. Volume 4538 of Lecture Notes in Computer Science, pages 228-239, Springer, 2007. [doi]

@inproceedings{ElghazelYDHD07,
  title = {A New Greedy Algorithm for Improving b-Coloring Clustering},
  author = {Haytham Elghazel and Tetsuya Yoshida and Véronique Deslandres and Mohand-Said Hacid and Alain Dussauchoy},
  year = {2007},
  doi = {10.1007/978-3-540-72903-7_21},
  url = {http://dx.doi.org/10.1007/978-3-540-72903-7_21},
  researchr = {https://researchr.org/publication/ElghazelYDHD07},
  cites = {0},
  citedby = {0},
  pages = {228-239},
  booktitle = {Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings},
  editor = {Francisco Escolano and Mario Vento},
  volume = {4538},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-72902-0},
}