Identification of vertices of vertex-labeled graphs (Q2879974)
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 6022821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identification of vertices of vertex-labeled graphs |
scientific article; zbMATH DE number 6022821 |
Statements
10 April 2012
0 references
topological environment
0 references
vertex-labeled graphs
0 references
self-location
0 references
Identification of vertices of vertex-labeled graphs (English)
0 references
The self-location problem for mobile agents in a topological environment is considered. The environment is modeled by a vertex-labeled graph. An agent can move on the graph's edges and observe the labels of vertices. A finite sets of words over the vertex-label alphabet distinguishing a given vertex from the others, called vertex identifier, is proposed. Existence conditions and complexity estimations for vertex identifiers are obtained and construction methods are developed.
0 references
0.8614760041236877
0 references
0.7531664967536926
0 references
0.7292861938476562
0 references
0.7025253772735596
0 references
0.6956729888916016
0 references
