Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012)
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 7674672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of minimum edge-fault tolerant connected dominating set in a general graph |
scientific article; zbMATH DE number 7674672 |
Statements
Construction of minimum edge-fault tolerant connected dominating set in a general graph (English)
0 references
14 April 2023
0 references
edge fault tolerance
0 references
connected dominating set
0 references
greedy algorithm
0 references
approximation ratio
0 references
0 references
0.870873212814331
0 references
0.8623090386390686
0 references
0.8336659669876099
0 references
0.8297380208969116
0 references
0.8273836374282837
0 references
