Algorithmic aspects of disjunctive total domination in graphs (Q2958321)
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 disjunctive total domination in graphs |
scientific article; zbMATH DE number 6679771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of disjunctive total domination in graphs |
scientific article; zbMATH DE number 6679771 |
Statements
Algorithmic Aspects of Disjunctive Total Domination in Graphs (English)
0 references
1 February 2017
0 references
trees
0 references
total domination
0 references
disjunctive total domination
0 references
minimum-cost flow algorithm
0 references
0.8933614492416382
0 references
0.863746166229248
0 references
0.8572589755058289
0 references
0.8513000011444092
0 references
0.8344988226890564
0 references
