Monitoring the edges of a graph using distances (Q5896103)
From MaRDI portal
(Redirected from Item:Q5918773)
| 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: Monitoring the edges of a graph using distances |
scientific article; zbMATH DE number 7567769
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monitoring the edges of a graph using distances |
scientific article; zbMATH DE number 7567769 |
Statements
Monitoring the edges of a graph using distances (English)
0 references
21 July 2020
0 references
4 August 2022
0 references
distance-edge-monitoring set
0 references
identification
0 references
shortest paths
0 references
bounds
0 references
complexity
0 references
approximation
0 references
0.9986774325370787
0 references
0.7997857928276062
0 references
0.779066801071167
0 references
0.7709825038909912
0 references
0.7259778380393982
0 references