Computing minimal doubly resolving sets of graphs (Q1013386)
From MaRDI portal
!
WARNING
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 5544737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimal doubly resolving sets of graphs |
scientific article; zbMATH DE number 5544737 |
Statements
Computing minimal doubly resolving sets of graphs (English)
0 references
17 April 2009
0 references
minimal doubly resolving sets
0 references
metric dimension
0 references
genetic algorithms
0 references
evolutionary approach
0 references
hypercubes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8430020809173584
0 references
0.8371279835700989
0 references
0.8049668669700623
0 references
0.7901106476783752
0 references
0.7808068990707397
0 references
