An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs (Q4614841)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm to solve L(0,1)-labelling problem on interval graphs |
scientific article; zbMATH DE number 7009329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs |
scientific article; zbMATH DE number 7009329 |
Statements
31 January 2019
0 references
frequency assignment
0 references
\(L(0,1)\)-labelling
0 references
interval graph
0 references
0.8574213981628418
0 references
0.8414745926856995
0 references
0.8296297788619995
0 references
0.8221820592880249
0 references
0.8218656778335571
0 references
