Algorithmic aspects of Roman graphs (Q4956471)
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: Algorithmic aspects of Roman graphs |
scientific article; zbMATH DE number 7389714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of Roman graphs |
scientific article; zbMATH DE number 7389714 |
Statements
2 September 2021
0 references
dominating set
0 references
Roman dominating function
0 references
algorithm
0 references
3-SAT problem
0 references
unicyclic graph
0 references
ALGORITHMIC ASPECTS OF ROMAN GRAPHS (English)
0 references
0.9178112745285034
0 references
0.9100555777549744
0 references
0.9090578556060792
0 references
0.8906146287918091
0 references
0.8864883184432983
0 references
