Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872)
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 5154790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the minimum connected domination on trapezoid graphs |
scientific article; zbMATH DE number 5154790 |
Statements
Efficient algorithms for the minimum connected domination on trapezoid graphs (English)
0 references
18 May 2007
0 references
algorithms and data structures
0 references
trapezoid graphs
0 references
dominating set
0 references
(weighted) connected dominating set
0 references
0 references
0.9976977705955504
0 references
0.8809366822242737
0 references
0.8252362012863159
0 references
