The 0-1 ant colony conditional coloring resolving algorithm for solving the metric dimension problem of graphs (Q4998288)
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: The 0-1 ant colony conditional coloring resolving algorithm for solving the metric dimension problem of graphs |
scientific article; zbMATH DE number 7365941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 0-1 ant colony conditional coloring resolving algorithm for solving the metric dimension problem of graphs |
scientific article; zbMATH DE number 7365941 |
Statements
1 July 2021
0 references
distance
0 references
metric dimension
0 references
resolving set
0 references
ant colony algorithm
0 references
resolving table
0 references
resolving neighbor
0 references
resolving degree
0 references
0-1 coloring
0 references
0.7528769373893738
0 references
0.7395257353782654
0 references
0.735956072807312
0 references
0.7276662588119507
0 references
