Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings

Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca. Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. In Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma, editors, Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Volume 5344 of Lecture Notes in Computer Science, pages 90-100, 2008. [doi]

@inproceedings{CrescenziIGRV08,
  title = {Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings},
  author = {Pilu Crescenzi and Miriam Di Ianni and Federico Greco and Gianluca Rossi and Paola Vocca},
  year = {2008},
  doi = {10.1007/978-3-540-92248-3_9},
  url = {http://dx.doi.org/10.1007/978-3-540-92248-3_9},
  researchr = {https://researchr.org/publication/CrescenziIGRV08},
  cites = {0},
  citedby = {0},
  pages = {90-100},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
  editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Daniël Paulusma},
  volume = {5344},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-540-92247-6},
}