On the Approximability of the $L(h,k)$-Labelling Problem on Bipartite Graphs (Extended Abstract)

Calamoneri, T.; Vocca, Paola

UnitusOpen

Welcome in UnitusOpen, the institutional repository and open access archive of the University of Tuscia.
UnitusOpen is the official channel of the University of Tuscia for collecting, archiving, and disseminating the scientific outputs of the researchers. Visitors of UnitusOpen may get access to open scientific outputs disseminated in accordance with the European requirements of Open Access or enter in contact with researchers for requesting information about their publications.

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

Page view(s)

58

Last Week
0

Last month
0

checked on May 28, 2023

Google Scholar^TM

Check

Altmetric

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

UnitusOpen

Page view(s)

Google ScholarTM

Altmetric

Google Scholar^TM