Computing Roman domatic number of graphs (Q284340)
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: Computing Roman domatic number of graphs |
scientific article; zbMATH DE number 6581513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Roman domatic number of graphs |
scientific article; zbMATH DE number 6581513 |
Statements
Computing Roman domatic number of graphs (English)
0 references
18 May 2016
0 references
Roman domatic number
0 references
graph
0 references
computational complexity
0 references
approximation algorithms
0 references
0.9311422
0 references
0 references
0.9258633
0 references
0 references
0.91851723
0 references
0.91594416
0 references
0.9144621
0 references
0.9107652
0 references
0 references
