Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215)
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 aspect on the minimum (weighted) doubly resolving set problem of graphs |
scientific article; zbMATH DE number 7595931
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs |
scientific article; zbMATH DE number 7595931 |
Statements
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (English)
0 references
4 October 2022
0 references
doubly resolving set
0 references
block graph
0 references
cactus graph
0 references
\(k\)-edge-augmented trees
0 references
0.9408189
0 references
0.9318759
0 references
0.9011849
0 references
0.89880276
0 references
0 references
0.88687605
0 references
0.8783762
0 references
