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

Calamoneri, T.; Vocca, Paola

doi:10.1007/11429647_7

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

Author(s)

Calamoneri, T.

Vocca, Paola

Date Issued

2005

Type

conferenceObject

Volume

3499

Issue

3499

Start Page

65

End Page

77

DOI

10.1007/11429647_7

ISBN

3540260528

Journal

Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings

Handle

http://hdl.handle.net/2067/38065

Conference(s)

Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings