Monitoring the edges of a graph using distances (Q5896103): Difference between revisions

From MaRDI portal
Page on [mardi] deleted: Publication:5896103
Merged Item from Q5918773
description / endescription / en
 
scientific article; zbMATH DE number 7567769
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1494.05033 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/j.dam.2021.07.002 / rank
 
Normal rank
Property / author
 
Property / author: Shih-Shun Kao / rank
 
Normal rank
Property / published in
 
Property / published in: Discrete Applied Mathematics / rank
 
Normal rank
Property / publication date
 
4 August 2022
Timestamp+2022-08-04T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 4 August 2022 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7567769 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3189639912 / rank
 
Normal rank
Property / zbMATH Keywords
 
distance-edge-monitoring set
Property / zbMATH Keywords: distance-edge-monitoring set / rank
 
Normal rank
Property / zbMATH Keywords
 
identification
Property / zbMATH Keywords: identification / rank
 
Normal rank
Property / zbMATH Keywords
 
shortest paths
Property / zbMATH Keywords: shortest paths / rank
 
Normal rank
Property / zbMATH Keywords
 
bounds
Property / zbMATH Keywords: bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation
Property / zbMATH Keywords: approximation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 14:41, 29 April 2024

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
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references