Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs (Q1799604)
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: Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs |
scientific article; zbMATH DE number 6958571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs |
scientific article; zbMATH DE number 6958571 |
Statements
Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs (English)
0 references
19 October 2018
0 references
graph algorithms
0 references
efficient domination
0 references
weighted efficient domination
0 references
planar graph
0 references
diameter
0 references
0 references
0.9001712799072266
0 references
0.8410305380821228
0 references
0.8402071595191956
0 references
0.8401124477386475
0 references
0.8393236994743347
0 references
