Efficient sets in partial \(k\)-trees (Q686252)
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: Efficient sets in partial k-trees |
scientific article; zbMATH DE number 428107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient sets in partial \(k\)-trees |
scientific article; zbMATH DE number 428107 |
Statements
Efficient sets in partial \(k\)-trees (English)
0 references
30 November 1993
0 references
The efficiency of a graph is the maximum number of vertices uniquely dominated by a subset of vertices in the graph. In this paper, a linear time algorithm is developed for finding the efficiency of a partial \(k\)- tree given its embedding in a \(k\)-tree.
0 references
efficient dominating set
0 references
partial \(k\)-tree
0 references
0.9017475247383118
0 references
0.9014913439750672
0 references
0.8043634295463562
0 references
