Efficient algorithms for Roman domination on some classes of graphs (Q1003729)
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 5523194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for Roman domination on some classes of graphs |
scientific article; zbMATH DE number 5523194 |
Statements
Efficient algorithms for Roman domination on some classes of graphs (English)
0 references
4 March 2009
0 references
graph algorithms
0 references
Roman domination
0 references
interval graphs
0 references
cographs
0 references
AT-free graphs
0 references
weight of a Roman dominating function
0 references
0.96934312582016
0 references
0.8665136098861694
0 references
0.8563037514686584
0 references
0.854703426361084
0 references
0.8526827096939087
0 references
