Finding the detour-critical edge of a shortest path between two nodes (Q293313): Difference between revisions

@@ Property / author @@
+Peter Widmayer
@@ Property / author: Peter Widmayer / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6590724
@@ Property / zbMATH DE Number: 6590724 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+shortest path
@@ Property / zbMATH Keywords: shortest path / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fault tolerance
@@ Property / zbMATH Keywords: fault tolerance / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+transient edge failures
@@ Property / zbMATH Keywords: transient edge failures / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+longest detour
@@ Property / zbMATH Keywords: longest detour / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+most critical edge
@@ Property / zbMATH Keywords: most critical edge / rank @@
+Normal rank

Revision as of 21:17, 27 June 2023