Efficient algorithms for network localization using cores of underlying graphs (Q742409)
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: Efficient algorithms for network localization using cores of underlying graphs |
scientific article; zbMATH DE number 6345740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for network localization using cores of underlying graphs |
scientific article; zbMATH DE number 6345740 |
Statements
Efficient algorithms for network localization using cores of underlying graphs (English)
0 references
18 September 2014
0 references
network localization
0 references
point set reconstruction
0 references
weighted graph embedding
0 references
graph turnpike problem
0 references
chordal graph
0 references
connected dominating set
0 references
0 references
0 references
0.9081371
0 references
0.8833473
0 references
0.8782681
0 references
0.87050277
0 references
