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

← Older edit

@@ description / en / description / en @@
-scientific article; zbMATH DE number 7223683
+scientific article; zbMATH DE number 7567769
@@ Property / author @@
-Joseph F. Ryan
@@ Property / author: Joseph F. Ryan / rank @@
-Normal rank
@@ Property / zbMATH Open document ID @@
+.05033
@@ Property / zbMATH Open document ID: 1494.05033 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/j.dam.2021.07.002
@@ Property / DOI: 10.1016/j.dam.2021.07.002 / rank @@
+Normal rank
@@ Property / author @@
+Joseph F. Ryan
@@ Property / author: Joseph F. Ryan / rank @@
+Normal rank
@@ Property / author @@
+Shih-Shun Kao
@@ Property / author: Shih-Shun Kao / rank @@
+Normal rank
@@ Property / published in @@
+Discrete Applied Mathematics
@@ Property / published in: Discrete Applied Mathematics / rank @@
+Normal rank
@@ Property / publication date @@
+August 2022Timestamp +2022-08-04T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2022-08-04T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 4 August 2022 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7567769
@@ Property / zbMATH DE Number: 7567769 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3001163125
@@ Property / OpenAlex ID: W3001163125 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3189639912
@@ Property / OpenAlex ID: W3189639912 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00029
@@ Property / arXiv ID: 2011.00029 / 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
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Network verification via routing table queries
@@ Property / cites work: Network verification via routing table queries / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the edge monitoring problem
+Normal rank
@@ Property / cites work @@
+Discovery of network properties with all-shortest-paths queries
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Exploring networks with traceroute-like probes: Theory and simulations
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The (weighted) metric dimension of graphs: hard and easy cases
+Normal rank
@@ Property / cites work @@
+Monitoring the edges of a graph using distances
@@ Property / cites work: Monitoring the edges of a graph using distances / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4119237
@@ Property / cites work: Q4119237 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2701740
@@ Property / cites work: Q2701740 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Mixed metric dimension of graphs
@@ Property / cites work: Mixed metric dimension of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Uniquely identifying the edges of a graph: the edge metric dimension
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Geodetic Set
@@ Property / cites work: Parameterized Complexity of Geodetic Set / rank @@
+Normal rank
@@ Property / cites work @@
+The metric dimension for resolving several objects
+Normal rank
@@ Property / cites work @@
+Strong edge geodetic problem in networks
@@ Property / cites work: Strong edge geodetic problem in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong metric dimension of graphs and digraphs
+Normal rank
@@ Property / cites work @@
+On Metric Generators of Graphs
@@ Property / cites work: On Metric Generators of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4075485
@@ Property / cites work: Q4075485 / rank @@
+Normal rank