Please use this identifier to cite or link to this item:
http://hdl.handle.net/2067/38065
Title: | On the Approximability of the $L(h,k)$-Labelling Problem on Bipartite Graphs (Extended Abstract) | Authors: | Calamoneri, T. Vocca, Paola |
Journal: | Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings | Issue Date: | 2005 | URI: | http://hdl.handle.net/2067/38065 | DOI: | 10.1007/11429647_7 |
Appears in Collections: | D1. Contributo in Atti di convegno |
Show full item record
All documents in the "Unitus Open Access" community are published as open access.
All documents in the community "Prodotti della Ricerca" are restricted access unless otherwise indicated for specific documents