A linear time algorithm for computing a most reliable source on a tree network with faulty nodes (Q621840): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.08.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1996969231
@@ Property / OpenAlex ID: W1996969231 / rank @@
+Normal rank
@@ Property / cites work @@
+A Reliability Model Applied to Emergency Service Vehicle Location
+Normal rank
@@ Property / cites work @@
+Reliability covering problems
@@ Property / cites work: Reliability covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
+Normal rank
@@ Property / cites work @@
+Location of facilities on a network subject to a single‐edge failure
+Normal rank
@@ Property / cites work @@
+A single facility location problem on a tree with unreliable edges
+Normal rank
@@ Property / cites work @@
+Locating A Broadcast Facility In An Unreliable Network
+Normal rank
@@ Property / cites work @@
+Q4355484
@@ Property / cites work: Q4355484 / rank @@
+Normal rank