On the approximability of the \(L(h,k)\)-labelling problem on bipartite graphs (extended abstract) (Q5710097)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2234710
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the approximability of the \(L(h,k)\)-labelling problem on bipartite graphs (extended abstract) |
scientific article; zbMATH DE number 2234710 |
Statements
Structural Information and Communication Complexity (English)
0 references
On the approximability of the \(L(h,k)\)-labelling problem on bipartite graphs (extended abstract) (English)
0 references
30 November 2005
0 references
0.8283423781394958
0 references
0.8186910152435303
0 references
0.8035925030708313
0 references
0.7987552285194397
0 references
0.7926753759384155
0 references